Cod sursa(job #979040)
| Utilizator | Data | 31 iulie 2013 11:02:04 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.96 kb |
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, m, z, x, y, t[100010], i, rx, ry;
/*int rad(int x){
while(t[x]>0)
x=t[x];
return x;
}*/
int rad(int x){
int y=x, aux;
while(t[x]>0)
x=t[x];
while(t[y]>0)
{
aux=y;
y=t[y];
t[aux]=x;
}
return x;
}
int main(){
f>>n>>m;
for(i=1; i<=n; i++)
t[i]=-1;
for(i=1; i<=m; i++)
{
f>>z>>x>>y;
rx=rad(x);
ry=rad(y);
if(z==1)
{
if(t[rx]<t[ry])
{
t[rx]+=t[ry];
t[ry]=rx;
}
else
{
t[ry]+=t[rx];
t[rx]=ry;
}
}
else
{
if(rx==ry)
g<<"DA\n";
else
g<<"NU\n";
}
}
return 0;
}
