제출 #1060168

#제출 시각아이디문제언어결과실행 시간메모리
1060168jamjanek자동 인형 (IOI18_doll)C++14
37 / 100
61 ms11952 KiB
#include "doll.h" #include<bits/stdc++.h> using namespace std; int liscie[1000010]; void create_circuit(int m, std::vector<int> A) { A.push_back(0); int n = A.size(), i; int base = 1; int log = 1; while(base<n){ base*=2; log++; } vector<int>pozycje; for(i=0;i<base;i++){ int x = i; int res = 0; int pom = base/2; while(x>0){ if(x%2)res+=pom; pom/=2; x/=2; } pozycje.push_back(res); } for(i=0;i<base;i++)liscie[i] = -1; for(i=n-1;i>=0;i--){ liscie[pozycje[pozycje.size()-(n-i)]] = A[i]; } vector<int>C(m+1, -1); vector<int>X,Y; for(i=1;i<base;i++){ if(i*2<base){ X.push_back(-(i*2)); Y.push_back(-(i*2+1)); } else{ X.push_back(liscie[i*2-base]); Y.push_back(liscie[i*2+1-base]); } } 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...