Cod sursa(job #1209610)
| Utilizator | Data | 18 iulie 2014 10:23:43 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,t,x,y,G[100005];
int grupa(int a)
{
if (G[a]==a) return a;
G[a]=grupa(G[a]);
return G[a];
}
inline void unific(int a, int b)
{
G[grupa(a)]=G[grupa(b)];
}
int main()
{
int i;
fin>>n>>m;
for (i=1;i<=n;++i)
G[i]=i;
for (i=1;i<=m;++i)
{
fin>>t>>x>>y;
if (t==1) unific(x,y);
else
{
if (grupa(x)==grupa(y)) fout<<"DA\n";
else fout<<"NU\n";
}
}
return 0;
}
