# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260911 | Alexa2001 | Mechanical Doll (IOI18_doll) | C++17 | 190 ms | 22256 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 "doll.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> x, y, c;
vector<bool> state;
int n, k, e, nodes = 1;
void create_tree(int node, int sz)
{
if(sz == 2)
{
if(e & 1)
{
x[node] = 1;
y[node] = 0;
e ^= 1;
}
else x[node] = y[node] = 0;
return;
}
if(e & (sz/2))
x[node] = 1, e ^= (sz/2);
else
{
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... |