Cod sursa(job #2390539)
| Utilizator | Data | 28 martie 2019 10:27:12 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.95 kb |
#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);
int i,tip,x,y,ok=0;
for(i=1;i<=N;i++)
{
V[i].push_back(i);
}
for(i=1;i<=M;i++)
{
in>>tip>>x>>y;
if(tip==1)
{
V[x].push_back(y);
V[y].push_back(x);
}
if(tip==2)
{
ok=0;
for(int k=1;k<=N;k++)
{
int gasit=0;
for(auto j:V[k])
if(j==x || j==y)
gasit++;
if(gasit==2)
{
ok=1;
out<<"DA"<<endl;
break;
}
}
if(ok==0)
out<<"NU"<<endl;
}
}
return 0;
}
