oj.uz

답안 #650244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
650244 2022-10-13T07:51:59 Z ojoConmigo 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 336 KB 
#include "prize.h"

int find_best(int n) {
	/*
	for(int i = 0; i < n; i++) {
		std::vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
	}
	*/
	//Subtask 1
	std::vector<int> res;
	int lo = 0, hi = n-1,ans = -1;
	while(lo <= hi){
		int mid = (lo+hi)/2;
		res = ask(mid);
		if(res[0] + res[1] == 0){
			return mid;
		}else if(res[0]){
			hi = mid-1;
		}else{
			lo = mid+1;
		}
	}
	return 0;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:13:23: warning: unused variable 'ans' [-Wunused-variable]
   13 |  int lo = 0, hi = n-1,ans = -1;
      |                       ^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 292 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 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 256 KB Output is correct

Subtask #2
0 / 80.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 284 KB Output is correct
5 Correct 1 ms 268 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 1 ms 272 KB answer is not correct
12 Halted 0 ms 0 KB -