oj.uz

답안 #1053933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053933 2024-08-11T21:37:00 Z aaaaaarroz 커다란 상품 (IOI17_prize) C++17
0 / 100
 42 ms 424 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>ask(int i);
int find_best(int n) {
	int l=0,r=n-1;
	while(l<r){
		int mid=(l+r)/2;
		vector<int>res=ask(mid);
		if(res[0]==res[1]&&res[0]==0){
			return mid;
		}
		if(res[0]==0){
			l=mid;
		}
		else{
			r=mid;
		}
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 42 ms 344 KB Incorrect
5 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Incorrect 37 ms 344 KB Incorrect
5 Halted 0 ms 0 KB -