Cod sursa(job #3272096)
| Utilizator | Data | 28 ianuarie 2025 13:00:05 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int main()
{
int n, m, t[100100], as, ad, z, x, y;
cin>>n>>m;
for(int i=1;i<=n;i++) t[i]=i;
for(int i=1;i<=m;i++)
{
cin>>z>>x>>y;
if(z==1)
{
if(t[x]!=t[y])
as=t[x];
ad=t[y];
for(int j=1;j<=n;j++) if(t[j]==ad) t[j]=as;
}
else
{
if(t[x]==t[y]) cout<<"DA"<<'\n';
else cout<<"NU"<<'\n';
}
}
return 0;
}
