제출 #289787

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
289787		Bill_00	커다란 상품 (IOI17_prize)	C++14	0 / 100	1 ms	256 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int ans,m;
int p[200001]={0};
void search(int mid,int l,int r,int l1,int r0){
	int ll=0,rr=0;
	vector<int>res=ask(mid);
	if(res[0]+res[1]==0){
		ans=mid;
		return;
	}
	if(l==r){
		return;
	}
	if(res[0]==0){
		ll++;
	}
	if(res[1]==0){
		rr++;
	}
	if(l1==res[1]){
		rr++;
	}
	if(r0==res[0]){
		ll++;
	}
	if(rr==0){
		if(l+1==mid) return;
		search(mid+r>>1,mid,r,res[1],r0);
	}
	if(ll==0){
		if(mid+1==r) return; 
		search(mid+l>>1,l,mid,l1,res[0]);
	}
}
int find_best(int n){
	m=n;
	/*for(int i = 0; i < n; i++) {
		std::vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
	}*/
	int l=0,r=n-1;
	int mid=(l+r)>>1;
	vector<int>lll=ask(l);
	vector<int>rrr=ask(r);
	search(mid,l,r,lll[1],rrr[0]);
	return ans;
}

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

prize.cpp: In function 'void search(int, int, int, int, int)':
prize.cpp:30:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |   search(mid+r>>1,mid,r,res[1],r0);
      |          ~~~^~
prize.cpp:34:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |   search(mid+l>>1,l,mid,l1,res[0]);
      |          ~~~^~

• Subtask 1: 0 / 20
• Subtask 2: 0 / 80