Cod sursa(job #553022)
Utilizator | Data | 13 martie 2011 13:43:25 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
using namespace std;
#define Nmax 100001
int main()
{
int P[Nmax], i, x, y, n, m,cod;
ifstream f("disjoint.in");
f>>n>>m;
ofstream g("disjoint.out");
for(i=1;i<=n;i++)
P[i]=i;
for(i=1;i<=m;i++)
{
f>>cod>>x>>y;
if(cod==1)
{
if(P[x]!=P[y])
P[y]=P[x];
}
else
{
if(P[x]==P[y])
g<<"DA\n";
else
g<<"NU\n";
}
}
f.close();
g.close();
return 0;
}