Cod sursa(job #3340680)
| Utilizator | Data | 15 februarie 2026 17:34:48 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
#define cin fin
#define cout fout
const int NMAX=100001;
int N, M, T[NMAX+1];
int Find(int x)
{
if (T[x]==0) return x;
return T[x]=Find(T[x]);
}
inline void Union(int rx, int ry)
{
T[rx]=ry;
}
int main()
{
int cod, x, y, rx, ry;
cin>>N>>M;
while (M--)
{
cin>>cod>>x>>y;
rx=Find(x);
ry=Find(y);
if (cod==1)
Union(rx, ry);
else if (rx==ry) cout<<"DA\n";
else cout<<"NU\n";
}
return 0;
}
