# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123346 | 2019-07-01T07:48:45 Z | neki | Mechanical Doll (IOI18_doll) | C++14 | 169 ms | 12820 KB |
#include "doll.h" #include <bits/stdc++.h> #define maxn 756000 #define loop(i, a, b) for(int i=a;i<b;i++) #define cc(a) cout<< a << endl; using namespace std; vector<int> arr; vector<int> X, Y; int cnt=-1; void ne(vector<int> sez){ int js=-cnt-1; cnt--; X.push_back(0);Y.push_back(0); if(sez.size()==2){ X[js]=sez[0]; Y[js]=sez[1]; } else{ vector<int> l;vector<int> r; loop(i, 0, sez.size()){ if(i%2==0) l.push_back(sez[i]); if(i%2==1) r.push_back(sez[i]); } X[js]=cnt;ne(l); Y[js]=cnt;ne(r); } } void create_circuit(int M, vector<int> A) { vector<int> C(M + 1);loop(i, 0, M+1) C[i]=-1; arr=A; int cr=1;for(;cr<arr.size()+1;cr<<=1); while(arr.size()!=cr) arr.push_back(-1); arr[arr.size()-1]=0; ne(arr); answer(C, X, Y); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 204 KB | Output is partially correct |
2 | Partially correct | 125 ms | 11640 KB | Output is partially correct |
3 | Partially correct | 121 ms | 11636 KB | Output is partially correct |
4 | Partially correct | 138 ms | 11788 KB | Output is partially correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 204 KB | Output is partially correct |
2 | Partially correct | 125 ms | 11640 KB | Output is partially correct |
3 | Partially correct | 121 ms | 11636 KB | Output is partially correct |
4 | Partially correct | 138 ms | 11788 KB | Output is partially correct |
5 | Partially correct | 143 ms | 12696 KB | Output is partially correct |
6 | Partially correct | 158 ms | 12720 KB | Output is partially correct |
7 | Partially correct | 138 ms | 12820 KB | Output is partially correct |
8 | Partially correct | 169 ms | 12640 KB | Output is partially correct |
9 | Partially correct | 137 ms | 11588 KB | Output is partially correct |
10 | Partially correct | 141 ms | 12436 KB | Output is partially correct |
11 | Partially correct | 137 ms | 12192 KB | Output is partially correct |
12 | Partially correct | 124 ms | 11992 KB | Output is partially correct |
13 | Partially correct | 128 ms | 12100 KB | Output is partially correct |
14 | Partially correct | 126 ms | 12248 KB | Output is partially correct |
15 | Partially correct | 128 ms | 12308 KB | Output is partially correct |
16 | Partially correct | 7 ms | 588 KB | Output is partially correct |
17 | Correct | 70 ms | 6360 KB | Output is correct |
18 | Partially correct | 126 ms | 11868 KB | Output is partially correct |
19 | Partially correct | 122 ms | 11884 KB | Output is partially correct |
20 | Partially correct | 139 ms | 12312 KB | Output is partially correct |
21 | Partially correct | 150 ms | 12176 KB | Output is partially correct |
22 | Partially correct | 133 ms | 12180 KB | Output is partially correct |