Cod sursa(job #3223923)
Utilizator | Data | 14 aprilie 2024 10:12:27 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
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;)
if(i>1) {
for(;p[j];j=p[j]);
for(;p[k];k=p[k]);
G<<(j==k?"DA\n":"NU\n");
} else
p[k]=j;
return 0;
}