Cod sursa(job #3139834)
Utilizator | Data | 2 iulie 2023 09:36:12 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream F("disjoint.in");
ofstream G("disjoint.out");
int i,j,k,p[100001];
int main()
{
for(F>>i>>j;F>>i>>j>>k;) {
for(;p[j];j=p[j]);
for(;p[k];k=p[k]);
if(i<2)
p[k]=j;
else
G<<(j!=k?"NU\n":"DA\n");
}
return 0;
}