제출 #987031

#제출 시각아이디문제언어결과실행 시간메모리
987031VMaksimoski008커다란 상품 (IOI17_prize)C++17
20 / 100
1 ms600 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; pii query(int p) { vector<int> res = ask(p); return { res[0], res[1] }; } int find_best(int n) { //one type 1 //n-1 type 2 int l=0, r=n-1, ans=0; while(l <= r) { int mid = (l + r) / 2; auto [a, b] = query(mid); if(a == 0 && b == 0) { ans = mid; break; } if(a > 0) r = mid - 1; else l = mid + 1; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...