# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76623 | georgerapeanu | Mechanical Doll (IOI18_doll) | C++11 | 121 ms | 10152 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 <queue>
using namespace std;
int sw[(int)4e5][2];
int trig[(int)2e5];
void create_circuit(int M, vector<int> A) {
for(int i = 0;i <= M;i++){
trig[i] = -1;
}
int N = A.size();
int lgN = 0;
while((1 << lgN) <= N){
lgN++;
}
lgN--;
int last_switch = -(lgN + 1);
queue< pair<int,int> > switches;
for(int i = 0;i < lgN;i++){
sw[i + 1][1] = -(i + 2);
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... |