Cod sursa(job #2949609)
Utilizator | Data | 1 decembrie 2022 10:38:07 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream F("disjoint.in");
ofstream G("disjoint.out");
int x,y,z,p[100001],n,m;
int main()
{
for(F>>n>>m;m--;) {
for(F>>x>>y>>z;p[y];y=p[y]);
for(;p[z];z=p[z]);
if(x==1)
p[y]=z;
else
G<<(y==z?"DA\n":"NU\n");
}
return 0;
}