제출 #418490

#제출 시각아이디문제언어결과실행 시간메모리
418490FlippenFazMechanical Doll (IOI18_doll)C++11
0 / 100
1 ms204 KiB
#include "doll.h" #include <bits/stdc++.h> using namespace std; vector<int> c; vector<int> x; vector<int> y; vector<vector<int>> cons; void create_circuit(int m, std::vector<int> a) { cons.resize(m+1); c.resize(m+1, -1); c[a.back()] = 0; int maxPow = ceil(log2(a.size())); a.resize( pow(2,maxPow), -1 ); for (int j = 1; j < pow(2,maxPow); j++) { x.push_back(-j*2 ); y.push_back(-j*2 - 1); } vector<int> ord; ord.push_back( pow(2,maxPow) ); int curPow = pow(2,maxPow-1); while (curPow > 0) { int curSize = ord.size(); for (int i = 0; i < curSize; i++) { ord.push_back(ord[i] - curPow); } curPow/=2; } int cnt = 0; for (int j = pow(2,maxPow)-2; j >= pow(2,maxPow-1)-1; j--) { y[j] = a[ord[cnt++]-1]; x[j] = a[ord[cnt++]-1]; } 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...