Cod sursa(job #2912239)
Utilizator | Data | 7 iulie 2022 15:54:38 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.27 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;n==2?G<<(y==z?"DA":"NU")<<'\n':p[z]=y) {
for(;p[y];y=p[y]);
for(;p[z];z=p[z]);
}
return 0;
}