# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093567 | Zero_OP | Joker (BOI20_joker) | C++14 | 248 ms | 15164 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"
using namespace std;
const int MAX = 2e5 + 5;
int n, m, q, f[MAX], eu[MAX], ev[MAX], lab[MAX], d[MAX];
bool exist_odd_cycle;
struct state{
int x, y;
};
stack<state> states;
void init(int n){
fill(lab, lab + n, -1);
fill(d, d + n, 0);
exist_odd_cycle = false;
}
int find_root(int u){
return lab[u] < 0 ? u : find_root(lab[u]);
}
int find_dist(int u){
return lab[u] < 0 ? 0 : d[u] ^ find_dist(lab[u]);
}
bool unite(int u, int v){
int l = find_dist(u) ^ find_dist(v) ^ 1;
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... |