Cod sursa(job #1050606)
Utilizator | Data | 8 decembrie 2013 20:05:20 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int main()
{
int n,m,i,cod,x,y,a[100001];
ifstream f("disjoint.in");
ofstream g("disjoint.out");
f>>n>>m;
for(i=0;i<n;i++)
a[i]=i;
for(i=0;i<m;i++){
f>>cod>>x>>y;
while(x!=a[x])
x=a[x];
while(y!=a[y])
y=a[y];
if(cod==1)
a[y]=x;
else{
if(x==y)
g<<"DA"<<'\n';
else
g<<"NU"<<'\n';
}
}
return 0;
}