Submission #1055352

#TimeUsernameProblemLanguageResultExecution timeMemory
1055352phoenix커다란 상품 (IOI17_prize)C++17
0 / 100
51 ms5624 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; const int N = 200200; vector<int> arr[N]; vector<int> ASK(int p) { if (arr[p].empty()) arr[p] = ask(p); return arr[p]; } int find_best(int n) { int i = 0; while (i < n) { if (ASK(i)[0] + ASK(i)[1] == 0) { return i; } int l = i, r = min(i + 100, n); while (r - l > 1) { int m = (l + r) / 2; if (ASK(m) == ASK(l)) l = m; else { if (ASK(m)[0] + ASK(m)[1] == 0) return m; r = m; } } i = r; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...