Cod sursa(job #697257)
| Utilizator | Data | 28 februarie 2012 23:32:49 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
int n,m,v[100002],i,x,y;
using namespace std;
int main ()
{
ifstream f("disjoint.in");
ofstream g("disjoint.out");
f>>n>>m;
for(i=1;i<=n;i++)
v[i]=i;
while(m)
{f>>x;
if(x%2)
{f>>x>>y;
v[x]=v[y];}
else
{f>>x>>y;
while(v[x]!=x) x=v[x];
while(v[y]!=y) y=v[y];
if(x==y)
g<<"DA\n";
else
g<<"NU\n";}
m--; }
f.close(); g.close();
return 0;
}
