Cod sursa(job #3373119)

Utilizator CorvinJudge0Corvin Judge CorvinJudge0 Data 6 noiembrie 2026 09:11:50
Problema Arbore partial de cost minim Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.73 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("kruskal.in");
ofstream fout("kruskal.out");
int n,m,a[1001],v[1001],c[1001],tata[101],p[1001],q[1001],s,k,i,j,x,y;
int main()
{
    fin >> n >> m;
    for(i=1;i<=m;i++)
        fin >> a[i] >> v[i] >> c[i];
    for(i=1;i<=m;i++)
        for(j=i+1;j<=m;j++)
            if(c[i]>c[j]){
                swap(c[i], c[j]);
                swap(a[i], a[j]);
                swap(v[i], v[j]);}
    for(i=1;i<=n;i++)tata[i] = i;
    for(i=1;i<=m;i++){
        x=a[i];
        y=v[i];
        while(tata[x]!=x)x=tata[x];
        while (tata[y]!= y)y=tata[y];
    if(x!=y){
            s+=c[i];
            k++;
            tata[x]=y;}
    }
    fout << s << endl;
    return 0;
}