Cod sursa(job #957591)
| Utilizator | Data | 5 iunie 2013 15:25:16 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
using namespace std;
#include<fstream>
#define NMax 100005
ifstream eu("disjoint.in");
ofstream tu("disjoint.out");
int N,M,TT[NMax];
void unite(int x, int y)
{
TT[x]=y;
}
int find(int x)
{
while(x!=TT[x])
x=TT[x];
return x;
}
int main()
{
int op,x,y;
eu>>N>>M;
for(int i=1;i<=N;i++)
TT[i]=i;
while(M--)
{
eu>>op>>x>>y;
if (op==1)
unite(find(x),find(y));
if(op==2)
if(find(x)==find(y))
tu<<"DA\n";
else
tu<<"NU\n";
}
return 0;
}
