Cod sursa(job #868639)

Utilizator lukkerLiNoimi Semain lukker Data 31 ianuarie 2013 12:39:45
Problema Paduri de multimi disjuncte Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <fstream>
#include <iostream>
using namespace std;
 
int main() {
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    int n, m;
    int *p, *r;
    fin>>n>>m;
    p = new int[n+1];
	r = new int[n+1];
    for(int i=1; i<=n; i++) {p[i]=i;r[i]=1;}
    for(int i=1; i<=m; i++) {
        int t,x,y;
        fin>>t>>x>>y;
        if(t==1) {
			if(r[y]>r[x]) {
				int c = x;
				x = y;
				y = c;
			}
			
            int a = p[y];
            while(a != p[a]) {
				p[a] = x;
				r[a] = r[x]+1;
				a = p[a];
			}
            p[a]=x;
			r[a]=r[x]+1;
        } else {
            int a, b;
            a = p[x];
            b = p[y];
            while(a != p[a]) a = p[a];
            while(b != p[b]) b = p[b];
            if(a==b) fout<<"DA"<<endl; else fout<<"NU"<<endl;
        }
    }
    return 0;
}