Cod sursa(job #2755495)
| Utilizator | Data | 27 mai 2021 15:41:06 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int N,M,c,x,y;
int L[100005];
int main()
{
fin>>N>>M;
for(int i=1;i<=N;i++)
L[i]=i;
for(int i=1;i<=M;i++)
{
fin>>c>>x>>y;
if(c==1)
{
if(x<y)
{
for(int j=1;j<=N;j++)
if(L[j]==L[y]) L[j]=L[x];
}
else
{
for(int j=1;j<=N;j++)
if(L[j]==L[x]) L[j]=L[y];
}
}
if(c==2)
{
if(L[x]==L[y]) fout<<"DA";
else fout<<"NU";
fout<<'\n';
}
}
return 0;
}
