Cod sursa(job #1442763)
| Utilizator | Data | 26 mai 2015 10:55:11 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int t[100001];
int query(int x)
{
int r=x;
while(r!=t[r]) r=t[r];
while(x!=r)
{
int aux=t[x];
t[x]=r;
x=aux;
}
return r;
}
int main()
{
int i,n,m,c,x,y;
in>>n>>m;
for(i=1;i<=n;i++)
t[i]=i;
for(i=1;i<=m;i++)
{
in>>c>>x>>y;
if(c==1) t[query(x)]=query(y);
else if(query(x)==query(y)) out<<"DA"<<'\n';
else out<<"NU"<<'\n';
}
}
