제출 #470637

#제출 시각아이디문제언어결과실행 시간메모리
470637Carmel_Ab1커다란 상품 (IOI17_prize)C++17
0 / 100
20 ms272 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; typedef vector<int>vi; //#include "grader.cpp" int find_best(int n) { int sz=450; vi prv={-1,-1}; for(int i=1; i<=n; i+=sz){ vi s=(prv[0]!=-1?ask(i):prv),e=ask(min(n,i+sz)); if(s[0]==e[0]) continue; for(int j=i; j<=min(n,i+sz); j++) { vi v=ask(i); if(v[0]==0 && v[1]==0) return i; } prv=e; } assert(0); return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...