Cod sursa(job #3373134)

Utilizator CorvinJudge0Corvin Judge CorvinJudge0 Data 6 noiembrie 2026 09:25:39
Problema Arbore partial de cost minim Scor 20
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.88 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int a[1005][1005], v[1005], tata[1005], n, m, x, y, c, mn, poz;
long long s;
int main()
{
    fin >> n >> m;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        a[i][j]=10000000000;
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y >> c;
        a[x][y]=c;
        a[y][x]=c;
    }
    v[1]=1;
    for(int i=1; i<n; i++)
    {
        mn=10000000000;
        poz=0;
        for(int j=1; j<=n; j++)
            if(v[j]==1)
            for(int k=1; k<=n; k++)
            if(v[k]==0 && a[j][k]<mn)
        {
            mn=a[j][k];
            poz=k;
            tata[k]=j;
        }
        v[poz]=1;
        s+=mn;
    }
        fout << s << endl;
        fout << n-1 << endl;
        for(int i=2; i<=n; i++)
            fout << tata[i] << " " << i << endl;
    return 0;
}