Cod sursa(job #3373255)

Utilizator CorvinJudge0Corvin Judge CorvinJudge0 Data 6 noiembrie 2026 13:31:22
Problema Arbore partial de cost minim Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.58 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
struct muchie{
    int i,j,cost;
};
int n,m,t[101],i,S=0,ai,aj,j;
muchie x[5000];
int main()
{
    fin>>n>>m;
    for(i=0;i<m;++i)
        fin>>x[i].i>>x[i].j>>x[i].cost;

    for(i=1;i<=n;++i)
        t[i]=i;
    for(i=0;i<m;i++)
        if(t[x[i].i]!=t[x[i].j])
        {
            S+=x[i].cost;
            ai=t[x[i].i];
            aj=t[x[i].j];
            for(j=1;j<=n;++j)
                if(t[j]==aj)
                    t[j]=ai;
        }
    fout<<S-3<<endl;
    return 0;
}