oj.uz

답안 #781286

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781286 2023-07-13T02:02:25 Z OrazB 커다란 상품 (IOI17_prize) C++14
20 / 100
 1 ms 296 KB 
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;

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

Compilation message

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 1 ms 292 KB answer is not correct
12 Halted 0 ms 0 KB -