# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
705766 | Abrar_Al_Samit | The Big Prize (IOI17_prize) | C++17 | 71 ms | 11344 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;
const int nax = 2e5 + 1;
vector<vector<int>>mem(nax, vector<int>(2, -1));
vector<int>ASK(int i) {
if(mem[i][0]==-1) {
mem[i] = ask(i);
}
return mem[i];
}
int find_best(int n) {
int sq = min(n, 500);
int mx = -1, id;
int cnt = 0;
auto up = [&] () {
++cnt;
if(cnt>10000) assert(false);
};
vector<int>prv;
for(int i=0; i<sq; ++i) {
up();
auto v = ASK(i);
if(v[0]+v[1]==0) {
return i;
}
if(v[0]+v[1]>mx) {
mx = v[0] + v[1];
id = i;
prv = v;
if(mx*mx>n) break;
}
}
while(id<n-1) {
int to = min(n-1, id+sq);
up();
auto cr = ASK(to);
if(cr[0]==prv[0] && cr[1]==prv[1]) {
id = to;
continue;
}
int l = 0, r = to-id;
while(l<r) {
int mid = (l+r+1)/2;
up();
cr = ASK(id+mid);
if(cr[0]==prv[0] && cr[1]==prv[1]) {
l = mid;
} else {
r = mid-1;
}
}
id += l+1;
while(id<n) {
up();
cr = ASK(id);
if(cr[0]+cr[1]==0) {
return id;
}
if(cr[0]+cr[1]==mx) {
prv = cr;
break;
}
++id;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |