제출 #339865

#제출 시각아이디문제언어결과실행 시간메모리
339865blueMechanical Doll (IOI18_doll)C++11
0 / 100
1 ms204 KiB
#include "doll.h" #include <vector> #include <iostream> using namespace std; void create_circuit(int M, vector<int> A) { vector<int> C(M+1, -1); vector<int> X, Y; int N = A.size(); if(N == 1) { C[0] = A[0]; answer(C, X, Y); return; } C[0] = A[0]; int p; for(p = 1; 2*(1 << p) < N; p++); X = vector<int>( (1 << (p+1)) - 1 , 1e9); Y = vector<int>( (1 << (p+1)) - 1 , 1e9 ); for(int i = 2; i < (1 << (p+1)); i++) { if(i % 2 == 0) X[i/2 - 1] = -i; else Y[i/2 - 1] = -i; } // cout << "0 " << C[0] << '\n'; // for(int i = 1; i < (1 << (p+1)); i++) cout << i << ' ' << X[i-1] << ' ' << Y[i-1] << '\n'; for(int i = (1 << p); i < (1 << (p+1)); i++) { if(i - (1 << p) + 1 < N) { if(i % 2 == 0) X[i/2 - 1] = A[i - (1 << p) + 1]; else Y[i/2 - 1] = A[i - (1 << p) + 1]; } else if(i == (1 << (p+1))-1) { Y[i/2 - 1] = 0; } else { if(i % 2 == 0) X[i/2 - 1] = -1; else Y[i/2 - 1] = -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...