# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710888 | tanprodium | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5;
/*int a[N + 5];
int n;*/
/*int* ask(int id) {
static int ans[2];
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;
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;
}*/