Pagini recente » Cod sursa (job #2105275) | Cod sursa (job #1416336) | Cod sursa (job #2547394) | Cod sursa (job #2181802) | Cod sursa (job #2162243)
#include <fstream>
#include <vector>
using namespace std;
int v[100002];
vector <int> graf[100002];
int main()
{
int n,m,tip,x,y;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
in>>n>>m;
for(int i=1;i<=n;i++)
{
v[i]=i;
}
for(int i=1;i<=m;i++)
{
in>>tip>>x>>y;
if(tip==1)
{
graf[x].push_back(y);
graf[y].push_back(x);
v[y]=v[x];
for(int j=0;j<graf[y].size();j++)
{
v[graf[y][j]]=v[x];
}
}
else
{
if(v[x]==v[y])
{
out<<"DA\n";
}
else
{
out<<"NU\n";
}
}
}
return 0;
}