Cod sursa(job #3137824)
Utilizator | Data | 15 iunie 2023 09:04:45 | |
---|---|---|---|
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 n,m,i,p[100001];
int main()
{
for(F>>n>>m;F>>i>>n>>m;) {
for(;p[n];n=p[n]);
for(;p[m];m=p[m]);
if(i<2)
p[m]=n;
else
G<<(n==m?"DA\n":"NU\n");
}
return 0;
}