Cod sursa(job #675860)
| Utilizator | Data | 8 februarie 2012 13:04:06 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int j,t[100003],n,m,i,x,y,p,a,b;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
t[i]=i;
for(i=1;i<=m;i++)
{
f>>p>>x>>y;
if(p==1)
{a=x;
b=y;
while(t[a]!=a)
a=t[a];
while(t[b]!=b)
b=t[b];
t[a]=t[b];
}
else
{
a=x;
b=y;
while(t[a]!=a)
a=t[a];
while(t[b]!=b)
b=t[b];
if(t[b]==t[a])
g<<"DA"<<'\n';
else
g<<"NU"<<'\n';
}
}
return 0;
}
