Pagini recente » Cod sursa (job #42232) | Cod sursa (job #751506) | Istoria paginii runda/tot | Cod sursa (job #1981034) | Cod sursa (job #661921)
Cod sursa(job #661921)
#include<fstream>
using namespace std;
int mult[100001],n;
void caz_1(int x, int y)
{int a,b;
a=mult[x]; b=mult[y];
for(int i=1;i<=n;i++)
if(mult[i]=a) mult[i]=b;
}
int main(){
int n, m, x, y, caz, rez;
fstream f("disjoint.in",ios::in);
fstream g("disjoint.out",ios::out);
f>>n>>m;
for(int i=1;i<=n;i++) //initializare multimi
mult[i]=i;
for(int i=1;i<=m;i++)
{f>>caz>>x>>y;
if(caz==1) caz_1(x,y);
if(caz==2) {if(mult[x]==mult[y]) g<<"DA\n";
else g<<"NU\n";}
}
return 0;}