# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
765447 | oyber | Joker (BOI20_joker) | C++14 | 96 ms | 10180 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 <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
#include <stack>
using namespace std;
vector<int> u;
vector<int> s;
vector<int> p;
int find(int n) {
if (u[n] == n) return n;
return find(u[n]);
}
int parity(int n) {
if (u[n] == n) return 0;
return parity(u[n])^p[n];
}
struct UniteInfo {
int a;
int b;
int sa;
};
UniteInfo unite(int a, int b) {
int ap = find(a);
int bp = find(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... |