# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
78782 | tincamatei | Mechanical Doll (IOI18_doll) | C++14 | 120 ms | 11844 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 "doll.h"
using namespace std;
int lastid;
vector<int> X, Y;
vector<pair<int, pair<bool, int> > > poz;
int dfs(int depth, int N, int p, bool branch, int papa, int bit = 0) {
if(depth >= 0) {
int id = -((int)X.size()) - 1;
X.push_back(0);
Y.push_back(0);
if((1 << depth) > N) {
X[-id - 1] = -1;
int r1 = dfs(depth - 1, N, p | (1 << bit), 1, id, bit + 1);
Y[-id - 1] = r1;
} else {
int r1 = dfs(depth - 1, (1 << depth), p, 0, id, bit + 1);
int r2 = dfs(depth - 1, N ^ (1 << depth), p | (1 << bit), 1, id, bit + 1);
X[-id - 1] = r1;
Y[-id - 1] = r2;
}
return id;
} else {
if((1 << bit) - 1 == p) {
return 0;
}
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... |