Cod sursa(job #2043150)
Utilizator | Panaete Adrian proflaurian | Data | 19 octombrie 2017 17:51:41 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int N = 100010;
int n,q,c,x,y,i,t[N],get_root(int);
int main()
{
cin>>n>>q;
for(i=1;i<=n;i++)
t[i]=i;
for(;q;q--)
{
f>>c>>x>>y;
x=get_root(x);
y=get_root(y);
if(c==1)
t[x]=y;
else
x==y?g<<"DA\n":g<<"NU\n";
}
return 0;
}
int get_root(int a)
{
if(t[a]==a)return a;
t[a]=get_root(t[a]);
return t[a];
}