Cod sursa(job #2419658)
| Utilizator | Data | 9 mai 2019 10:16:38 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int main()
{
int n,m,cod,x,y;
int v[100001]={};
in>>n>>m;
for(int i=1;i<=n;i++)
v[i]=i;
for(int i=1;i<=m;i++){
in>>cod>>x>>y;
if(cod==1){
int cautare=v[y];
for(int j=1;j<=n;j++)
if(v[j]==cautare)
v[j]=v[x];
}
if(cod==2)
if(v[x]==v[y])
out<<"DA"<<endl;
else
out<<"NU"<<endl;
}
return 0;
}
