Cod sursa(job #1051406)
Utilizator | Data | 9 decembrie 2013 23:39:30 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int main()
{
int n,m,i,tip,x,y,tati[100020];
fin>>n>>m;
for(i=0;i<n;i++)
tati[i]=i;
for(i=0;i<m;i++){
fin>>tip>>x>>y;
while(x!=tati[x])
x=tati[x];
while(y!=tati[y])
y=tati[y];
if(tip==1)
tati[y]=x;
else{
if(x==y)
fout<<"DA"<<'\n';
else
fout<<"NU"<<'\n';
}
}
return 0;
}