Cod sursa(job #2102315)
| Utilizator | Data | 8 ianuarie 2018 17:30:31 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int nx=100002;
int a[nx],n,op,m,x,y;
int grupa (int x)
{
if(x==a[x]) return a[x];
a[x]=grupa(a[x]);
return a[x];
}
void uneste (int x, int y)
{
a[grupa(x)]=grupa(y);
}
int main()
{
in>>n>>m;
for(int i=1; i<=n; i++)
a[i]=i;
for(;m;m--)
{
in>>op>>x>>y;
if(op==1) uneste(x,y);
else
{
if(grupa(x)==grupa(y)) out<<"DA\n";
else out<<"NU\n";
}
}
return 0;
}
