Cod sursa(job #1450593)

Utilizator minimartieniIova Adrian minimartieni Data 13 iunie 2015 19:17:41
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include<fstream>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");

struct muchie
{
       int x,y,c;
};

muchie V[100];
int n,m,A[100][100],P[100],k;

void citire()
{
     fin>>n>>m;
     for(int i=1;i<=m;i++)
        fin>>V[i].x>>V[i].y>>V[i].c;
}

void colorare(int r,int cul)
{
  int s,d,i,X[100];
  s=d=1;
  X[1]=r;
  P[r]=1;
  while(s<=d)
  {
	for(int i=1;i<=n;i++)
	if(P[i]!=cul && A[X[s]][i])
	   {d++; X[d]=i; P[i]=cul;
	   }
      s++;
  }
}

void ordonare()
{
    muchie aux;
    for(int i=1;i<m;i++)
        for(int j=i+1;j<=m;j++)
               if(V[i].c>V[j].c)
               {
                   aux=V[i];
                   V[i]=V[j];
                   V[j]=aux;
               }
}

int main()
{
    int i;
    citire();
    for(i=1;i<=n;i++) P[i]=i;
    ordonare();
    k=0; i=1;
    while(k<n-1)
    {
       if(P[V[i].x]!=P[V[i].y])
       {
	    fout<<V[i].x<<" "<<V[i].y<<" "<<V[i].c<<"\n";
	    A[V[i].x][V[i].y]=A[V[i].y][V[i].x]=1;
	    if(P[V[i].x]<P[V[i].y]) colorare(V[i].y,P[V[i].x]);
	    else colorare(V[i].x,P[V[i].y]);
	    k++;
       }
       i++;
    }
}