Submission #115165

#TimeUsernameProblemLanguageResultExecution timeMemory
115165MladenPMechanical Doll (IOI18_doll)C++17
0 / 100
7 ms8396 KiB
#include "doll.h" #include <bits/stdc++.h> #define MAXN (1<<20) #define MAXM 200010 #define PRINT(x) cerr<<#x<<' '<<x<<endl; #define pb push_back using namespace std; vector<int> X, Y, C; int x[MAXN], y[MAXN], stdva; int N, idx; void ubaci(int node, int put, int kraj, int dub) { //PRINT(node); if(dub == stdva) { if(put == 0) x[node] = kraj; if(put == 1) y[node] = kraj; return; } if(!(put&1)) { if(x[node] == -1) x[node] = --idx; ubaci(-x[node], put>>1, kraj, dub+1); } else { if(y[node] == -1) y[node] = --idx; ubaci(-y[node], put>>1, kraj, dub+1); } } void nadji(int node) { if(y[node] == -1) { y[node] = 0; return; } nadji(-y[node]); } void create_circuit(int M, std::vector<int> A) { N = A.size(); C.resize(M+1); for(int i = 1; i <= M; i++) C[i] = -1; C[0] = -1; idx = -1; for(int i = 0; i < 20; i++) { if((1<<i) > N) { stdva = i; break; } } fill(x, x+MAXN, -1); fill(y, y+MAXN, -1); for(int i = 0; i < N; i++) { ubaci(1, i, A[i], 1); } ubaci(1, N, 0, 1); //nadji(1); idx = -idx; X.resize(idx); Y.resize(idx); //if((1<<stdva) == N) //PRINT(idx); //C[A[N-1]] = 0; for(int i = 1; i <= idx; i++) { //PRINT(x[i]); //PRINT(y[i]); X[i-1] = x[i]; Y[i-1] = y[i]; } answer(C, X, Y); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...