Cod sursa(job #1708356)

Utilizator PaulLuchianPaul Luchian PaulLuchian Data 26 mai 2016 22:22:24
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("f.in");
ofstream g("f.out");
const int inf=9999;
int n,m,A[100][100],P[100];

void citire()
{    int i,j,k,c;
     f>>n>>m;
     for(i=1;i<n;i++)
        for(j=i+1;j<=n;j++)
            A[i][j]=A[j][i]=inf;
     for(int k=1;k<=m;k++)
        { f>>i>>j>>c;
          A[i][j]=A[j][i]=c;
        }
}

int main()
{
    int i,k,minn,x,costmin=0,nrm=0;
    citire();
    for(i=2;i<=n;i++) P[i]=1;
    for(k=1;k<n;k++)
    {
       minn=inf;
       for(i=1;i<=n;i++)
           if(P[i] && A[P[i]][i]<minn)
           {
               minn=A[P[i]][i]; x=i;
           }
       g<<P[x]<<" "<<x<<" "<<A[P[x]][x]<<endl;
       costmin=costmin+A[P[x]][x];
       nrm=nrm+1;
       for(i=1;i<=n;i++)
           if(P[i] && A[P[i]][i]>A[i][x])
                P[i]=x;
       P[x]=0;
    }
    g<<"Cost: "<<costmin<<endl;
    g<<"Muchii: "<<nrm;
    f.close();
    g.close();
    return 0;
}