# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
754925 | MilosMilutinovic | ICC (CEOI16_icc) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 101;
int n, fa[N];
int gfa(int x) { return fa[x] == x ? x : fa[x] = gfa(fa[x]); }
//void setRoad(int x, int y) {
// printf("new Road %d %d\n", x, y);
//}
bool query(vector<int> x, vector<int> y) {
int sz_x = x.size();
int sz_y = y.size();
int qx[sz_x], qy[sz_y];
for (int i = 0; i < sz_x; i++)
qx[i] = x[i];
for (int i = 0; i < sz_y; i++)
qy[i] = y[i];
return query(sz_x, sz_y, qx, qy);
// printf("query\n");
// for (int i : x) printf("%d ", i); printf("\n");
// for (int i : y) printf("%d ", i); printf("\n");
// int f;
// scanf("%d", &f);
// return f;
}
void add(vector<int>& v, int comp) {
for (int i = 1; i <= n; i++)
if (gfa(i) == gfa(comp))
v.push_back(i);
}