#include<bits/stdc++.h>
#include "prize.h"
#define MAXN 10007
using namespace std;
int n;
int solve(int l,int r,int reml,int remr){
int mid=(l+r)/2,p;
vector<int> curr=ask(mid);
if(curr[0]==0 and curr[1]==0)return mid;
curr[0]-=reml; curr[1]-=remr;
if(curr[0]>0){
p=solve(l,mid,reml,remr+curr[1]);
if(p!=0)return p;
}
if(curr[1]>0){
p=solve(mid,r,reml+curr[0],remr);
if(p!=0)return p;
}
return 0;
}
int find_best(int N){
N=n;
return solve(1,n,0,0);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
82 ms |
1432 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
87 ms |
1436 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |