제출 #165239

#제출 시각아이디문제언어결과실행 시간메모리
165239SegtreeThe Big Prize (IOI17_prize)C++14
20 / 100
89 ms504 KiB
#include<iostream>
#include"prize.h"
using namespace std;
typedef long long ll;

int find_best(int n){
    int l=0,r=n-1,mid;
    while(l<r){
	mid=(l+r)>>1;
	vector<int> a=ask(mid);
	if(a[0]==0&&a[1]==0){
	    return mid;
	}
	if(a[0]==1){
	    r=mid-1;
	}
	if(a[1]==1){
	    l=mid+1;
	}
    }
}

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:21:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...