# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102991 | username | 커다란 상품 (IOI17_prize) | C++14 | 0 ms | 0 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;
typedef pair<int,int> pii;
typedef vector<int> VI;
#define REP(i,j,k) for(register int i=(j);i<(k);++i)
#define RREP(i,j,k) for(register int i=(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define MST(a,v) memset(a,(v),sizeof a)
#define pb push_back
#define mid (l+r>>1)
#define lch (idx*2+1)
#define rch (idx*2+2)
#define F first
#define S second
#define de(...) cerr<<__VA_ARGS__
#define ar(a,s,t) {REP(__i,s,t)de(a[__i]<<' ');de(endl);}
VI tt;
void dfs(int l,int r,int ll,int rr,int mx,int&res){
de(l<<" ~ "<<r<<endl);
if(res>=0)return;
else if(l>=r)return;
else{
tt=ask(mid);
if(tt[0]+tt[1]==0)res=mid;
else if(tt[0]+tt[1]==mx){
if(tt[0]>ll)dfs(l,mid,ll,tt[1],mx,res);
if(tt[1]>rr)dfs(mid+1,r,tt[0],rr,mx,res);
}else{
dfs(l,mid,ll,rr+1,mx,res);
dfs(mid+1,r,ll+1,rr,mx,res);
}
}
}
int find_best(int n){
int res=-1,mx=0;
REP(i,0,min(n,448)){
tt=ask(i);
mx=max(mx,tt[0]+tt[1]);
}
dfs(0,n,0,0,mx,res);
return res;
}