Cod sursa(job #770616)
Utilizator | FMI Alex Oprea BlackLord | Data | 23 iulie 2012 15:28:59 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int a[100001], i, x, y, m, n, v, x1, y1;
int main(){
f>>n>>m;
for(int cresc=1; cresc<=m; cresc++)
{
f>>v>>x1>>y1;
x=a[x1];
y=a[y1];
if(v==1)
{
for(i=1; i<=n; i++)
if(a[i]==x)
a[i]=y;
}
else
{
if(a[x]==a[y])
g<<"DA\n";
else
g<<"NU\n";
}
}
f.close();
g.close();
return 0;
}