Mai intai trebuie sa te autentifici.
Cod sursa(job #1450143)
| Utilizator | Data | 11 iunie 2015 17:52:35 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,m,n,T[100010],A[100010],B[100010],x,y,a,b,c;
vector<int> A,B;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
T[i]=i;
for(;m;m--)
{
f>>c>>x>>y;
for(;T[x]-x;x=T[x])A[++a]=x;
for(;T[y]-y;y=T[y])B[++b]=y;
for(;a;)T[A[a--]]=x;
for(;b;)T[B[b--]]=y;
if(c==1)T[x]=y;
else if(x==y)g<<"DA\n";
else g<<"NU\n";
}
return 0;
}
