Cod sursa(job #2166278)
Utilizator | Data | 13 martie 2018 16:26:28 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
int p[100010],n,m;
int main()
{
ifstream in("disjoint.in");
ofstream out("disjoint.out");
in>>n>>m;
for(int i=1;i<=n;i++) p[i]=i;
for(int i=1;i<=m;i++)
{
int x,y,q;
in>>q>>x>>y;
if(q==1) p[x]=p[y];
if(q==2)
if(p[x]==p[y])out<<"DA\n";
else out<<"NU\n";
}
return 0;
}