Cod sursa(job #3296500)
Utilizator | Data | 13 mai 2025 07:22:34 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int a[100001];
int main()
{
int n,m;
for(cin>>n>>m;m--;) {
int i,j,k;
for(cin>>i>>j>>k;a[j];j=a[j]);
for(;a[k];k=a[k]);
if(i>1)
cout<<(j==k?"DA\n":"NU\n");
else
a[k]=j;
}
return 0;
}