Cod sursa(job #2693955)

Utilizator SirbuSirbu Ioan Sirbu Data 7 ianuarie 2021 18:07:29
Problema Arbore partial de cost minim Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.14 kb
#include <bits/stdc++.h>
#define MMax 400001
#define NMax 200001

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

struct edge {
    int x, y, c, OK;
}v[MMax];

int t[NMax];
int N, M, ct, nr;
int rx,ry,x,y;

bool cmp(edge u,edge v){
    return u.c<v.c;
}

int radacina(int x) {

    int y,aux,r;
    r=x;

    while(t[r]!=0)
        r=t[r];

    y=x;

    while(t[y]!=0){
        aux=t[y];
        t[y]=r;
        y=aux;
    }
    return r;
}

int main()
{
    fin >> N >> M;
    for(int i = 1; i <= M; i++)
        fin >> v[i].x >> v[i].y >> v[i].c;

    for(int i=1; i <= N; i++)
        t[i] = 0;

   sort(v+1,v+M+1,cmp);

    ct = 0;
    nr = 0;
    int i = 1;

    while(nr < N-1) {
        x = v[i].x; y = v[i].y;
        rx=radacina(x);
        ry=radacina(y);
        if(rx != ry) {
            ct=ct+v[i].c;
            t[ry]=rx;
            v[i].OK = 1;
            nr++;
        }
        i++;
    }

    fout << ct << '\n'<<N-1<<'\n';

    for(int i = 1; i <= M; i++)
        if(v[i].OK == 1)
            fout << v[i].x << ' ' << v[i].y << '\n';

	return 0;
}