Pagini recente » Cod sursa (job #2231086) | Cod sursa (job #432607) | Cod sursa (job #591101) | Cod sursa (job #3235781) | Cod sursa (job #1397296)
//#include <iostream>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <bitset>
#include <limits>
#include <fstream>
#include <cstring>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
#define nmax 100010
#define mod 1000007
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define inf numeric_limits<int>::max()
#define forv(v,it) for (vector<int>::iterator it=v.begin();it!=v.end();it++)
int n,m,t[nmax],r[nmax],tip,x,y;
int rad(int x)
{
int r,y;
for (r=x;t[r]!=r;r=t[r]);
for (;t[x]!=x;)
{
y=t[x];
t[x]=r;
x=y;
}
return r;
}
void unite(int x,int y)
{
if (r[x]>r[y]) t[y]=x;
else t[x]=y;
if (r[x]==r[y])
r[x]++;
}
int main()
{
int i,j;
cin>>n>>m;
for (i=1;i<=n;i++)
{
t[i]=i;
r[i]=1;
}
for (i=1;i<=m;i++)
{
cin>>tip>>x>>y;
if (tip==2)
{
if (rad(x)==rad(y)) cout<<"DA\n";
else cout<<"NU\n";
}
else unite(rad(x),rad(y));
}
}