Cod sursa(job #632169)
Utilizator | Data | 10 noiembrie 2011 14:41:11 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int v[100001],n,m,i,y,x,op;
int main()
{
ifstream f("disjoint.in");
ofstream g("disjoint.out");
f>>n>>m;
for(i=1;i<=m;i++)
{f>>op;
f>>x>>y;
if(op==1)
v[y]=x;
else
if(op==2)
{if(v[x]==v[y])
g<<"NU"<<"\n";
else
g<<"DA"<<"\n";}
}
f.close();
g.close();
return 0;
}