Cod sursa(job #2616138)
| Utilizator | Data | 16 mai 2020 20:02:46 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.97 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream r("disjoint.in");
ofstream w("disjoint.out");
int v[100002], len[100002];
int root(int a)
{
if(v[a]==a)
{
return a;
}
return v[a]=root(v[a]);
}
int main()
{
int n, m;
r>>n>>m;
for(int i=1; i<=n; i++)
{
v[i]=i;
len[i]=1;
}
for(int i=0; i<m; i++)
{
int t;
r>>t;
if(t==1)
{
int a, b;
r>>a>>b;
a=root(a);
b=root(b);
if(a>b){
swap(a, b);
}
if(len[a]==len[b]){
len[a]++;
}
v[b]=a;
}
else
{
int a, b;
r>>a>>b;
if(root(a)==root(b))
{
w<<"DA\n";
}
else
{
w<<"NU\n";
}
}
}
return 0;
}
