Cod sursa(job #455781)
Utilizator | Szabo Krisztian k_killer | Data | 14 mai 2010 10:51:46 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
#include<fstream>
using namespace std;
int main(){
int v[100010],x,y,z,i,n,m;
ifstream fin;
ofstream fout;
fin.open("disjoint.in");
fout.open("disjoint.out");
fin >> n >> m;
for(i=1;i<=n;i++)
v[i]=i;
for(i=0;i<m;i++){
fin >> x >> y >> z;
while(v[y]!=y)
y=v[y];
while(v[z]!=z)
z=v[z];
if(x==1)
v[y]=z;
else{
if (y==z)
fout << "DA\n";
else
fout << "NU\n";
}
}
return 0;
}