Pagini recente » Borderou de evaluare (job #1546214) | Borderou de evaluare (job #1538518) | Diferente pentru problema/infinitywar intre reviziile 2 si 3 | Atasamentele paginii Infinitywar | Cod sursa (job #2682003)
#include <fstream>
using namespace std;
int n,m,x,y,i,v[100001],cod;
int radacina(int x)
{
while(v[x]!=0)x=v[x];
return x;
}
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int main()
{
f>>n>>m;
while(m--)
{
f>>cod;
f>>x>>y;
if(cod==1)
v[radacina(x)]=radacina(y);
if(cod==2)
{
if(radacina(x)==radacina(y))g<<"DA\n";
else g<<"NU\n";
}
}
}