# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75052 | KieranHorgan | Mechanical Doll (IOI18_doll) | C++17 | 2 ms | 256 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;
pair<int, int> exits[400005];
vector<int> X, Y;
int nodeIdx = 1;
void build(vector<int> cur) {
int curNode = nodeIdx++;
if(cur.size() == 1) {
if(cur[0] < 0) {
exits[curNode] = {-cur[0], 0};
return;
}
exits[curNode] = {cur[0], -1};
return;
}
vector<int> nextCur;
for(int i = 0; i < cur.size(); i+=2) {
nextCur.push_back(cur[i]);
}
build(nextCur);
nextCur.clear();
exits[curNode] = {-(curNode+1), -(nodeIdx)};
for(int i = 1; i < cur.size(); i+=2) {
nextCur.push_back(cur[i]);
}
build(nextCur);
nextCur.clear();
}
void create_circuit(int M, vector<int> A) {
int N = A.size();
vector<int> C(M + 1);
C[0] = -1;
for (int i = 1; i <= M; ++i) {
C[i] = -1;
}
vector<int> cur;
for(int i = 0; i < A.size(); i++) {
cur.push_back(A[i]);
}
cur.back() = -cur.back();
build(cur);
for(int i = 1; i < nodeIdx; i++) {
X.push_back(exits[i].first);
Y.push_back(exits[i].second);
cerr << i << ": " << X.back() << " " << Y.back() << endl;
}
answer(C, X, Y);
}
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... |