#include <bits/stdc++.h>
#define D 500
#include "prize.h"
#define maxN 200002
using namespace std;
int i,x=0;
vector <int> v,a[maxN];
vector <int> u,q;
int find_best(int n){
for(i=1;i<=min(500,n);i++){
if(a[n-i].empty()) a[n-i]=ask(n-i);
if(a[n-i][0]+a[n-i][1]>x) x=a[n-i][0]+a[n-i][1];
if(a[n-i][0]+a[n-i][1]==0) return i;
}
if(n>D){
for(i=0;i<min(500,n);i++){
if(a[i][0]+a[i][1]==x) {u.push_back(a[i][0]); q.push_back(i);}
}
for(i=0;i<D;i++){
if(a[i*(n/D)].empty()) a[i*(n/D)]=ask(i*(n/D));
if(a[i*(n/D)][0]+a[i*(n/D)][1]==x) {u.push_back(a[i*(n/D)][0]); q.push_back(i*(n/D));}
}
}
u.push_back(n);
q.push_back(n);
int p=-1;
for(int i=0;i<x;i++){
int l,d,m,tmp;
tmp=lower_bound(u.begin(),u.end(),v.size()+1)-u.begin();
l=p+1; d=q[tmp];
while(l<d){
m=(l+d)/2;
if(a[m].empty()) a[m]=ask(m);
if(a[m][0]+a[m][1]==x){
if(a[m][0]-v.size()>0) d=m-1;
else l=m+1;
}
else{
d=m;
}
}
v.push_back(l);
p=l;
}
for(i=0;i<v.size();i++){
if(a[v[i]].empty()) a[v[i]]=ask(v[i]);
if(a[v[i]][0]+a[v[i]][1]==0) return v[i];
}
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:48:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<v.size();i++){
~^~~~~~~~~
prize.cpp:52:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
17 ms |
9848 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
16 ms |
10072 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
