Cod sursa(job #2534191)
| Utilizator | Data | 30 ianuarie 2020 10:33:07 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#define nmax 100004
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int fa[nmax], n, m, cod, x, y;
int getFather(int x) {
if(fa[x]==x)
return x;
return fa[x]=getFather(fa[x]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
fa[i]=i;
for(int i=1;i<=m;i++) {
f>>cod>>x>>y;
if(cod==1)
fa[getFather(x)]=getFather(y);
else {
if(getFather(x)==getFather(y))
g<<"DA\n";
else
g<<"NU\n";
}
}
f.close();
g.close();
return 0;
}
