# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988264 | toan2602 | ICC (CEOI16_icc) | C++14 | 86 ms | 760 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<bits/stdc++.h>
#include "icc.h"
using namespace std;
int par[105];
vector<int> node[105];
bool mark[105];
void make_set(int n) {
for (int i = 1; i <= n; i++) {par[i] = -1; node[i].push_back(i);}
}
int find_anc(int x) {
if(par[x] < 0) return x;
return par[x] = find_anc(par[x]);
}
void union_set(int a, int b){
a = find_anc(a);
b = find_anc(b);
if(a != b) {
if(abs(par[a]) < abs(par[b])) swap(a, b);
for (int i: node[b]) node[a].push_back(i);
node[b].clear();
par[a] += par[b];
par[b] = a;
}
}
int ask(int n, int m, vector<int> &a, vector <int> &b)
{
Compilation message (stderr)
# | 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... |