| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 229117 | cfalas | 커다란 상품 (IOI17_prize) | C++14 | 109 ms | 512 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>
using namespace std;
#include "prize.h"
#define MID ((l+r)/2)
typedef vector<int> vi;
int N;
int rec(int l=0, int r=N-1){
if(l>r) return -1;
if(l==r){
vi a = ask(l);
if(a[0]+a[1]==0) return l;
else return -1;
}
//cout<<l<<" "<<r<<endl;
vi a = ask(MID);
int res = -1;
if(a[0]) res = max(res, rec(l, MID-1));
if(a[1]) res = max(res, rec(MID+1,r));
if(a[0]+a[1]==0) return MID;
return res;
}
int find_best(int n) {
N = n;
int l=0, r=n-1;
int m;
int pos=0;
vector<int> res;
for(int i=0;i<474 && i<n;i++){
res = ask(i);
if(res[0] + res[1] >= sqrt(n)-10){ pos = i; break;}
if(res[0]+res[1]==0) return i;
}
return rec(pos+1,r);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
