Cod sursa(job #2471671)
| Utilizator | Data | 11 octombrie 2019 10:41:31 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
///Var 1
#include <bits/stdc++.h>
#define K 100002
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int t[K],h[K];
int tata (int x)
{
if(t[x]==0)
return x;
return tata(t[x]);
}
int main()
{
int i,n,m,cod,x,y,tx,ty;
f>>n>>m;
for(i=1;i<=n;i++)
t[i]=0,h[i]=1;
while(m--)
{
f>>cod>>x>>y;
if(cod==2)
if(tata(x)==tata(y))
g<<"DA\n";
else g<<"NU\n";
else
{
tx=tata(x);ty=tata(y);
t[tx]=ty;
}
}
}
