Cod sursa(job #1345783)
| Utilizator | Data | 17 februarie 2015 21:10:08 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#define nmax 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[nmax],n,m;
void uneste(int x,int y)
{
t[t[x]]=t[y];
}
int tata(int x)
{
if(t[x]==x)
return x;
t[x]=tata(t[x]);
return t[x];
}
int main()
{
fin>>n>>m;
int cod,x,y;
for(int i=1;i<=n;i++)
t[i]=i;
for(int i=1;i<=m;i++)
{
fin>>cod>>x>>y;
if(cod==1)
uneste(x,y);
else
if(tata(x)==tata(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
return 0;
}
