제출 #288981

#제출 시각아이디문제언어결과실행 시간메모리
288981wdjpng커다란 상품 (IOI17_prize)C++17
20 / 100
3030 ms512 KiB
#include "prize.h"
#define lint long long
#define rep(i, n) for (int i = 0; i < n; i++)

using namespace std;

int find_best(int n)
{
	int oldSum = 1e9;
	int curI = -1;
	bool first=true;
	int q=0;
	while (true)
	{
		int start=-1, end=n;
		while(end-start>1){
			int cur = (start+end)/2;
			if(q==1e4){while (true)
			{
				q++;
			}
			}
			vector<int>ans=ask(cur);
			q++;
			if(first){
				first=false;
				oldSum=ans[0]+ans[1];
			}
			if(ans[0]+ans[1]==0){return cur;}
			if(ans[0]+ans[1]<oldSum){
				oldSum=ans[0]+ans[1];
				break;
			}
			else if(ans[0]) end=cur;
			else start=cur;
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'int find_best(int)':
prize.cpp:10:6: warning: unused variable 'curI' [-Wunused-variable]
   10 |  int curI = -1;
      |      ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...