# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797421 | WongChun1234 | The Big Prize (IOI17_prize) | C++14 | 77 ms | 2816 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<bits/stdc++.h>
using namespace std;
const int N=200050;
const bool DEBUG=0;
int n,l,r,lbound,rbound,mid,done[N],mx;
pair<int,int> res[N];
vector<int> pos,apos;
pair<int,int> qry(int id){
if (id>=n||id<0) return {-1,-1};
if (done[id]) return res[id];
vector<int> resp=ask(id);
done[id]=1;
res[id]={resp[0],resp[1]};
return res[id];
}
int sum(int id){
return qry(id).first+qry(id).second;
}
int find_best(int N) {
n=N;
if (n<=5000&&(!DEBUG)){
for (int i=0;i<n;i++){
if (sum(i)==0) return i;
}
}
for (int i=0;i<min(712,n);i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |