제출 #799759

#제출 시각아이디문제언어결과실행 시간메모리
799759Liudas커다란 상품 (IOI17_prize)C++17
0 / 100
87 ms292 KiB
#include <bits/stdc++.h> #include "prize.h" using namespace std; int find_best(int N){ int step = sqrt(N); auto t = ask(0); int s = t[0] + t[1]; int ans = 0; while(s){ for(int i = (N - 1) % step; i < N; i += step){ int l = max(0, i - step); auto k = ask(i); if(k[0]){ for(int j = l; j <= i; j ++){ k = ask(j); if(k[0] + k[1] < s){ s = k[0] + k[1]; ans = j; i = 1e9; break; } } } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...