Cod sursa(job #3185734)
Utilizator | Data | 20 decembrie 2023 08:39:34 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
#define NMAX 100001
typedef long long ll;
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
ll n, m, comp[NMAX], cod, x, y;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
comp[i]=i;
for(int i=1;i<=m;i++)
{
fin>>cod>>x>>y;
if(cod==1)
{
int mata=comp[x];
int tactu=comp[y];
for(int j=1;j<=n;j++)
if(comp[j]==mata)
comp[j]=tactu;
}
else
{
if(comp[x]==comp[y])
fout<<"DA"<<'\n';
else
fout<<"NU"<<'\n';
}
}
return 0;
}