# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
799766 | Liudas | The Big Prize (IOI17_prize) | C++17 | 38 ms | 384 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 <bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int N){
int step = 50;
int s = 1;
int ans = 0;
int mb = 0;
int l = 0, r = N - 1;
//cout << step << endl;
for(int i = 0; i < N && s; i += step){
int p = min(r, i + step);
int tb = 0;
int t = 1;
for(; p >= i && t; p --){
auto k = ask(p);
t = k[0] - mb;
tb = max(tb, k[0]);
s = k[0] + k[1];
//cout << p << " " << k[0] << " " << k[1] << endl;
}
mb = max(tb, mb);
l = p + 1;
}
return l;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |