Mai intai trebuie sa te autentifici.
Cod sursa(job #3262561)
| Utilizator | Data | 10 decembrie 2024 19:14:03 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int mv[100005];
int findr(int u)
{
if(mv[u]==u)
return u;
else{
return mv[u]=findr(mv[u]);
}
}
void unire(int u,int v){
int ru,rv;
ru=findr(u);
rv=findr(v);
mv[ru]=rv;
}
int main()
{
int n,i,x,y,m,c;
fin>>n>>m;
for(i=1;i<=n;i++)
mv[i]=i;
for(i=1;i<=m;i++)
{
fin>>c>>x>>y;
if(c==1)
{
unire(x,y);
}
else
{
if(findr(x)==findr(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}
