Cod sursa(job #2329898)
Utilizator | Data | 27 ianuarie 2019 17:31:54 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.87 kb |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
struct UF
{
vector<int>t;
void build(int n)
{
t.resize(n+1);
for(int i=1;i<=n;i++)
{
t[i]=i;
}
}
int dad(int a)
{
if(a==t[a])
{
return a;
}
else
{
t[a]=dad(t[a]);
return t[a];
}
}
void uni(int a,int b)
{
a=dad(a);
b=dad(b);
if(a!=b)
{
t[a]=b;
}
}
bool same(int a,int b)
{
return (dad(a)==dad(b));
}
};
#define read(FILENAME) freopen((FILENAME+".in").c_str(),"r",stdin)
#define write(FILENAME) freopen((FILENAME+".out").c_str(),"w",stdout)
#define files(FILENAME) read(FILENAME),write(FILENAME)
const string FILENAME="disjoint";
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
files(FILENAME);
int n,q;
cin>>n>>q;
UF kek;
kek.build(n);
while(q--)
{
int t,a,b;
cin>>t>>a>>b;
if(t==1)
{
kek.uni(a,b);
}
else
{
if(kek.same(a,b))
{
cout<<"DA\n";
}
else
{
cout<<"NU\n";
}
}
}
return 0;
}
/**
**/