Cod sursa(job #1371259)
| Utilizator | Data | 3 martie 2015 20:14:25 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
#define mx 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int tata[mx];
int n,m,i,x,y,caz;
int grupa(int nod)
{
if(tata[nod]==nod) return nod;
else tata[nod]=grupa(tata[nod]);
return tata[nod];
}
void unite(int x, int y)
{
tata[grupa(x)]=grupa(y);
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++) tata[i]=i;
for(i=1;i<=m;i++)
{
fin>>caz>>x>>y;
if(caz==1) unite(x,y);
else {
if(grupa(x)!=grupa(y))
fout<< "nu\n";
else fout<<"da\n";
}
}
return 0;
}
