제출 #778633

#제출 시각아이디문제언어결과실행 시간메모리
778633benjaminkleyn커다란 상품 (IOI17_prize)C++17
20 / 100
1123 ms1048576 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; #define mp make_pair bool asked[200000] = {false}; int L[200000], R[200000]; bool Ask(int i) { if (asked[i]) return L[i] + R[i] == 0; asked[i] = true; vector<int> res = ask(i); L[i] = res[0], R[i] = res[1]; return L[i] + R[i] == 0; } int Find(int l, int r) { int m = (l + r) / 2; if (Ask(m)) return m; if (R[l] == R[r] && L[r] == L[l]) return -1; int x = Find(l, m); if (x >= 0) return x; int y = Find(m, r); if (y >= 0) return y; return -1; } int find_best(int n) { if (Ask(0)) return 0; if (Ask(n-1)) return n-1; return Find(0, n - 1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...