제출 #73968

#제출 시각아이디문제언어결과실행 시간메모리
73968renatsj커다란 상품 (IOI17_prize)C++14
0 / 100
4 ms524 KiB
#include<bits/stdc++.h> #include "prize.h" using namespace std; int i,j,n,m,l,r,c,xl,xr,maz,rez; vector<int> xx; int find_best(int n) { l=0; r=n-1; rez=0; maz=0; while (true) { //cout << l << " " << r << "\n"; while (l<r) { c=l+(r-l)/2; //cout << l << " " << c << " " << r << " " << maz << "\n"; xx=ask(c); xl=xx[0]; xr=xx[1]; if (xl+xr==0) { return c; } if (xl+xr>maz) { l=0; r=n-1; rez=0; maz=xl+xr; } else if (xl>rez) { r=c-1; } else { l=c+1; } } xx=ask(l); if (xl+xr==0) { return l; } rez++; l++; //cout << l << " " << r << "\n"; xx=(ask(l)); xl=xx[0]; xr=xx[1]; while (xl+xr<maz) { l++; rez++; //cout << l << " " << r << "\n"; xx=(ask(l)); xl=xx[0]; xr=xx[1]; } if (xl+xr>maz) { maz=xl+xr; l=0; r=n-1; rez=0; } r=n-1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...