Mai intai trebuie sa te autentifici.
Cod sursa(job #3292217)
Utilizator | Data | 7 aprilie 2025 16:10:50 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <bits/stdc++.h>
#define nmax 32002
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m;
int T[100002];
int Radacina(int k)
{ if(T[k]==k) return k;
int rod=k;
while(T[rod]!=rod) rod=T[rod];
return rod;
}
void cerinta1(int x, int y)
{ ///int rx=Radacina(x);
int ry=Radacina(y);
T[x]=ry;
}
void cerinta2(int x, int y)
{ int rx=Radacina(x);
int ry=Radacina(y);
if(rx==ry) g<<"DA\n"; else g<<"NU\n";
}
int main()
{ f>>n>>m;
for(int i=1; i<=n; i++) T[i]=i;
for(int op,a,b; m; m--)
{ f>>op>>a>>b;
if(op==1) cerinta1(a,b);
if(op==2) cerinta2(a,b);
}
g.close();
f.close();
return 0;
}