# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605554 | Vanilla | ICC (CEOI16_icc) | C++17 | 150 ms | 544 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 maxn = 102;
int dsu [maxn];
vector <int> el [maxn];
int dad (int x) {
return dsu[x] = (x == dsu[x] ? x: dad(dsu[x]));
}
void merge (int x, int y){
x = dad(x), y = dad(y);
if (x != y) {
// if (el[x].size() < el[y].size()) swap(x, y);
for (int j: el[y]) el[x].push_back(j);
el[y].clear();
dsu[y] = x;
}
}
int qq (vector <int> a, vector <int> b) {
return query(a.size(), b.size(), a.data(), b.data());
}
void run(int n) {
srand(time(NULL));
for (int i = 1; i <= n; i++) {
dsu[i] = i;
el[i].push_back(i);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |