# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
453191 | lukadupli | XORanges (eJOI19_xoranges) | C++14 | 679 ms | 10724 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>
#define f first
#define s second
using namespace std;
typedef pair <int, int> pii;
const int MAX = 1 << 18;
struct tournament
{
pii nodes[2 * MAX];
pii merge_nodes(pii l_node, int l_node_size, pii r_node, int r_node_size){
pii res = {l_node.f, 0};
if(l_node_size > 1) res.s = l_node.s;
if((l_node_size) % 2){
if(r_node_size > 1) res.f ^= r_node.s;
res.s ^= r_node.f;
}
else{
res.f ^= r_node.f;
if(r_node_size) res.s ^= r_node.s;
}
return res;
# | 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... |