Cod sursa(job #1315355)
Utilizator | Neamt Mihai Mitsa3 | Data | 12 ianuarie 2015 19:19:56 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
#define MAX 100005
int dad[MAX];
int sef(int i)
{
if(dad[i] != i)
dad[i] = sef(dad[i]);
return dad[i];
}
int main()
{
int n, m, cod, x, y;
fin >> n >> m;
for(int i = 1; i<=n; i++)
dad[i] = i;
for(int i = 1; i<=m; i++)
{
fin >> cod >> x >> y;
x = sef(x);
y = sef(y);
if(cod == 1)
dad[x] = dad[y];
if(cod == 2)
{
if(x == y)
fout << "DA\n";
else
fout << "NU\n";
}
}
return 0;
}