Cod sursa(job #553023)
| Utilizator | Data | 13 martie 2011 13:48:17 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include<fstream>
using namespace std;
#define Nmax 100001
int P[Nmax],n;
void uneste(int x, int y)
{
int m1,m2,i;
m1=P[y];
m2=P[x];
for(i=1;i<=n;i++)
if(P[i]==m2)
P[i]=m1;
}
int main()
{
int i, x, y, 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)
uneste(x,y);
else
{
if(P[x]==P[y])
g<<"DA\n";
else
g<<"NU\n";
}
}
f.close();
g.close();
return 0;
}
