Submission #710881

#TimeUsernameProblemLanguageResultExecution timeMemory
710881tanprodiumThe Big Prize (IOI17_prize)C++14
20 / 100
1 ms308 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; const int N = 2e5; int a[N + 5]; //int n; /*vector<int> ask(int id) { vector<int> ans(2, 0); for (int i = 0; i < id; i++) if (a[i] < a[id]) ++ans[0]; for (int i = id + 1; i < n; i++) if (a[i] < a[id]) ++ans[1]; return (ans); }*/ int find_best(int n) { int l = 0, r = n - 1; while (l <= r) { int mid = (l + r) >> 1; vector<int> take = ask(mid); if (take[0]) r = mid - 1; else l = mid + 1; } return (l - 1); } /*void solve() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; find_best(n); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...