Cod sursa(job #1097792)
Utilizator | Data | 3 februarie 2014 22:27:55 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <vector>
using namespace std;
#define dmax 100001
#define pb push_back
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
vector <int> v[dmax];
int r[dmax],n,m;
int root_up(int x)
{
if(r[x]!=x) r[x]=root_up(r[x]);
return r[x];
}
int main()
{
int a, b, k;
fin >> n >> m;
for(int i=1; i<=n; i++)r[i]=i;
for(int i=1; i<=m; i++)
{
fin>>k>>a>>b;
if(k==1)r[root_up(b)]=root_up(a);
if(k==2)if(root_up(a)==root_up(b))fout<<"DA\n";
else fout<<"NU\n";
}
return 0;
}