# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75734 | KieranHorgan | Mechanical Doll (IOI18_doll) | C++17 | 144 ms | 16408 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> A, X, Y, C;
int dep[200];
int nextSwitch = -1;
vector<int> AdjList[200005];
int recurseThroughTree(vector<int> b) {
if(b.size() == 1) return b[0];
int curSwitch = nextSwitch--;
vector<int> a;
for(int i = 0; i < b.size(); i+=2)
a.push_back(b[i]);
int l = a.back() == -1 ? -1 : recurseThroughTree(a);
a.clear();
for(int i = 1; i < b.size(); i+=2)
a.push_back(b[i]);
int r = a.back() == -1 ? -1 : recurseThroughTree(a);
if(X.size() <= abs(curSwitch)-1) X.resize(abs(curSwitch)), Y.resize(abs(curSwitch));
X[abs(curSwitch)-1] = l;
Y[abs(curSwitch)-1] = r;
return curSwitch;
}
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... |