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 fenwick[300000]{0}, N;
int sum(int x){
int s = 0;
for(; x>0; x-=(x&-x))
s+=fenwick[x];
return s;
}
int query(int a, int b){return sum(b)-sum(a-1);}
void update(int x, int v){
for(; x <= N; x+=(x&-x))
fenwick[x]+=v;
}
int find_best(int n) {
N=n; int l = -1, r = n-1;
for(int i = 0; i < 500; i++){
l++, r = n-1;
while(l<r){
int mid = (l+r+1)/2;
auto x = ask(mid);
if(x[0]+x[1]==0) return mid;
if(x[0]==query(0,mid-1)) l=mid;
else r=mid;
}
update(l,1);
}
}
Compilation message (stderr)
prize.cpp: In function 'int find_best(int)':
prize.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
33 | }
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |