# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
534713 | benson1029 | The Big Prize (IOI17_prize) | C++14 | 98 ms | 508 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;
vector< pair<int,int> > v;
int sum;
int ans;
void recur(int l, int r) {
if(ans!=-1) return;
if(l>r) return;
int mid = (l+r)/2;
for(int i=mid; i<=r; i++) {
vector<int> tmp = ask(i);
if(tmp[0]+tmp[1] > sum) {
recur(l, mid-1);
recur(i+1, r);
return;
} else {
v.push_back({tmp[0]+tmp[1], i});
if(tmp[0]+tmp[1]==0) {
ans=i;
return;
}
}
}
for(int i=mid-1; i>=l; i--) {
vector<int> tmp = ask(i);
if(tmp[0]+tmp[1] > sum) {
recur(l, i-1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |