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