Mai intai trebuie sa te autentifici.
Cod sursa(job #404420)
Utilizator | Data | 26 februarie 2010 09:33:49 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int v[100010],x,y,z,i,n,m;
int main()
{
ifstream f ("disjoint.in");
ofstream g("disjoint.out");
f>>n>>m;
for(i=1;i<=n;i++)
v[i]=i;
for(i=0;i<m;i++)
{
f>>x>y>>z;
while(v[y]!=y)
y=v[y];
while(v[z]!=z)
z=v[z];
if(x==1)
v[y]=z;
else
{
if(y==z)
g<<"DA"<<"\n";
else g<<"NU"<<"\n";
}
f.close();
g.close();
}
return 0;
}