Cod sursa(job #2285829)
Utilizator | Data | 19 noiembrie 2018 12:52:14 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
std::ifstream in("disjoint.in");
std::ofstream out("disjoint.out");
using namespace std;
int sir[100005];
int n,m;
int a,b,c;
int main()
{
in>>n>>m;
for(int i=0;i<m;i++)
{
in>>a>>b>>c;
if(a==1)
{
sir[b]=a;
}
else if(a==2)
{
if(sir[b]==sir[c])
{
out<<"NU\n";
}
else out<<"DA\n";
}
}
return 0;
}