Cod sursa(job #1944030)
Utilizator | Data | 28 martie 2017 22:11:16 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int tata[100001],tip,x,y,n,m,i;
int main()
{
f>>n>>m;
for(i=1;i<=m;i++){
f>>tip>>x>>y;
while(tata[x]!=0)
x=tata[x];
while(tata[y]!=0)
y=tata[y];
if(tip==2)
if(x==y)
g<<"DA"<<'\n';
else
g<<"NU"<<'\n';
else
tata[x]=y;
}
return 0;
}