Cod sursa(job #2200599)
| Utilizator | Data | 1 mai 2018 22:43:38 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int m, t[100002];
inline int tata(int x)
{
while(t[x]!=0)
x=t[x];
return x;
}
void unite(int n1,int n2)
{
t[tata(n1)]=tata(n2);
}
int main()
{
int op, x, y;
f>>m>>m;
while(f>>op>>x>>y)
{
if(op==1)
unite(x, y);
else if(tata(x)==tata(y))
g<<"DA\n";
else
g<<"NU\n";
}
return 0;
}
