제출 #1055354

#제출 시각아이디문제언어결과실행 시간메모리
1055354phoenix커다란 상품 (IOI17_prize)C++17
20 / 100
56 ms5460 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) { int x = ASK(i)[0] + ASK(i)[1]; if (!x) return i; if (false) i++; else { int l = i, r = 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...