Cod sursa(job #1789515)
| Utilizator | Data | 27 octombrie 2016 08:24:11 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <cstdio>
#include<vector>
using namespace std;
int n,m,tx,ty;
vector<int>v[100001];
int seek(int x)
{
if(v[x].size()==0)
return x;
else seek(v[x][0]);
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1,x,y,t;i<=m;i++)
{
scanf("%d%d%d",&t,&x,&y);
if(t==1)
{
tx=seek(x);
ty=seek(y);
v[ty].push_back(tx);
}
else if(seek(x)==seek(y))
printf("DA\n");
else printf("NU\n");
}
return 0;
}
