| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1024396 | HappyCapybara | The Big Prize (IOI17_prize) | C++17 | 60 ms | 432 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;
int find_best(int n){
if (n <= 500){
for (int i=0; i<n; i++){
vector<int> res = ask(i);
if (res[0]+res[1] == 0) return i;
}
}
int k = 0, j = 0;
for (int i=0; i<500; i++){
vector<int> res = ask(i);
if (res[0]+res[1] == 0) return i;
if (res[0]+res[1] > k){
k = res[0]+res[1];
j = i;
}
if (res[0]+res[1] < k) j++;
}
int l = 499;
while (j != k){
l++;
int r = n;
while (l != r-1){
int m = (l+r)/2;
vector<int> res = ask(m);
if (res[0]+res[1] == 0) return m;
if (res[0]+res[1] == k){
if (res[0] > j) r = m;
else l = m;
}
else r = m;
}
j++;
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
