Cod sursa(job #3156313)
Utilizator | Data | 11 octombrie 2023 10:40:42 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.98 kb |
#include <fstream>
using namespace std;
ifstream cin ("disjoint.in");
ofstream cout ("disjoint.out");
int v[100001],r[100001];
int main()
{
int n,i,q,cer,c1,c2,j,cnt=0,sx,sy,mini,maxi;
cin>>n>>q;
for(i=1;i<=n;i++)
v[i]=i;
for(j=1;j<=q;j++)
{
cin>>cer>>c1>>c2;
if(cer==1)
{
int mini=min(v[c1],v[c2]),maxi=max(v[c1],v[c2]);
v[c1]=mini;
v[c2]=maxi;
for(i=1;i<=n;i++)
{
if(v[i]==maxi)
{
v[i]=mini;
}
}
}
else
{
cnt++;
if(v[c1]==v[c2])
r[cnt]=1;
else
r[cnt]=0;
}
}
for(i=1;i<=cnt;i++)
{
if(r[i]==1)
cout<<"DA"<<"\n";
else
cout<<"NU"<<"\n";
}
return 0;
}