# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70318 | gnoor | The Big Prize (IOI17_prize) | C++17 | 69 ms | 2116 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 <vector>
#include <algorithm>
#include <cstring>
using namespace std;
int lft[200100];
int rgt[200100];
int _ask(int x) {
if (lft[x]!=-1) return lft[x]+rgt[x];
auto res = ask(x);
lft[x]=res[0];
rgt[x]=res[1];
return lft[x]+rgt[x];
}
int mx=-1;
int ans=-1;
bool solve(int l,int r,int sl,int sr) {
int m=(l+r)>>1;
int res;
while (m<=r) {
res=_ask(m);
if (res==0) {
ans=m;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |