Pagini recente » Cod sursa (job #2677248) | Cod sursa (job #2828785) | Cod sursa (job #1096343) | Cod sursa (job #3001071) | Cod sursa (job #2390561)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int main()
{
int N,M;
in>>N>>M;
vector <vector<int>> V(N+1);
vector <int> comp(N+1);
int i,tip,x,y,ok=0;
for(i=1;i<=N;i++)
{
V[i].push_back(i);
comp[i]=i;
}
for(i=1;i<=M;i++)
{
in>>tip>>x>>y;
if(tip==1)
{
if(V[x].size()<V[y].size())
{
for(auto j: V[x])
{
V[y].push_back(j);
comp[j]=y;
}
}
else
{
for(auto j: V[y])
{
V[x].push_back(j);
comp[j]=x;
j=0;
}
}
}
if(tip==2)
{
if(comp[x]==comp[y])
out<<"DA"<<"\n";
else
out<<"NU"<<"\n";
}
}
return 0;
}