Cod sursa(job #1450142)
Utilizator | Data | 11 iunie 2015 17:46:47 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,m,n,T[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(;;x=T[x]){A.push_back(x);if(T[x]==x)break;}
for(;;y=T[y]){B.push_back(y);if(T[y]==y)break;}
for(;A.size();A.pop_back())T[A.back()]=x;
for(;B.size();B.pop_back())T[B.back()]=y;
if(c==1)T[x]=y;
else if(x==y)g<<"DA\n";
else g<<"NU\n";
}
return 0;
}