Pagini recente » Cod sursa (job #207747) | Cod sursa (job #78519) | Cod sursa (job #2148645) | Cod sursa (job #142305) | Cod sursa (job #642981)
Cod sursa(job #642981)
#include<fstream>
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int n,m;
int apart[100001];
int vec[100001][4000];
int main(){
ifstream f("disjoint.in");
ofstream g("disjoint.out");
f>>n>>m;
int i,j;
int a,x,y;
for(i=1;i<=n;i++){
vec[i][0]=1;
vec[i][1]=i;
apart[i]=i;
}
for(i=1;i<=m;i++){
f>>a>>x>>y;
if(a==1){
/*
for(j=1;j<=n;j++)
cout<<apart[j]<<" ";
cout<<"\n";
for(j=1;j<=n;j++){
for(int q=1;q<=vec[j][0];q++)
cout<<vec[j][q]<<" ";
cout<<"\n";
}
*/
int vecx=apart[x];
int vecy=apart[y];
for(j=1;j<=vec[vecy][0];j++){
apart[vec[vecy][j]]=vecx;
}
for(j=vec[vecx][0]+1;j<=vec[vecx][0]+vec[vecy][0];j++){
vec[vecx][j]=vec[vecy][j-vec[vecx][0]];
}
vec[vecx][0]=vec[vecx][0]+vec[vecy][0];
}
else{
if(apart[x]==apart[y]){
g<<"DA\n";
}
else{
g<<"NU\n";
}
}
}
return 0;
}