# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164692 | SmuggingSpun | The Big Prize (IOI17_prize) | C++20 | 1070 ms | 11156 KiB |
#include<bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n) {
vector<vector<int>>cnt(n, vector<int>(2, -1));
auto id = [&] (int i){
if(cnt[i][0] != -1){
return cnt[i];
}
return cnt[i] = ask(i);
};
for(int i = 0; i < n; ){
if(id(i)[0] == 0 && id(i)[1] == 0){
return i;
}
if(id(i) != id(i + 1)){
i++;
}
else{
int low = i + 2, high = n - 2, p = n - 1;
while(low <= high){
int mid = (low + high) >> 1;
if(id(i) != id(mid)){
high = (p = mid) - 1;
}
else{
}
}
i = p;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |