Submission #251398

#TimeUsernameProblemLanguageResultExecution timeMemory
251398nafis_shifatThe Big Prize (IOI17_prize)C++14
20 / 100
72 ms364 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
	int ind=0;
	int pos=0;
	for(int i=0;i<n;i=pos+1) {
		vector<int> r=ask(i);
		if(r[0]+r[1]==0)return i;

		int lo=i+1;
		int hi=n-1;
		
		

		while(lo<=hi) {
			int mid=lo+hi>>1;
			vector<int> tmp=ask(mid);

			if(tmp[0]+tmp[1]==0)return mid;

			if(tmp[0]> r[0] || (tmp[0]==r[0] && r[1]>tmp[1])) {
				pos=mid;
				hi=mid-1;
			}else {
				lo=mid+1;
				
			}
		}

	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:17:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid=lo+hi>>1;
            ~~^~~
prize.cpp:5:6: warning: unused variable 'ind' [-Wunused-variable]
  int ind=0;
      ^~~
prize.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...