Mai intai trebuie sa te autentifici.
Cod sursa(job #2357681)
| Utilizator | Data | 27 februarie 2019 17:27:24 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.84 kb |
#include <fstream>
#define lim 100000
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,sef[lim+5];
int sefsuprem(int x)
{
if(sef[x]==x) return x;
else return sef[x]=sefsuprem(sef[x]);
}
void unire(int x, int y)
{
int sefsx=sefsuprem(x);
int sefsy=sefsuprem(y);
sef[sefsx]=sefsy;
}
int sefsuprem2(int x)
{
if(sef[x]==x) return x;
else return sefsuprem(sef[x]);
}
int p,x,y;
int main()
{
int i;
in>>n>>m;
for(i=1;i<=n;i++) sef[i]=i;
for(i=1;i<=m;i++)
{
in>>p>>x>>y;
if(p==1) unire(x,y);
else
{
int sefx,sefy;
sefx=sefsuprem2(x);
sefy=sefsuprem2(y);
if(sefx==sefy) out<<"DA\n";
else out<<"NU\n";
}
}
return 0;
}
