oj.uz

답안 #1078060

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078060 2024-08-27T12:08:07 Z kilikuma 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 356 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

int find_best(int n) {

	int l = 0, r = n - 1;

	while (r - l > 1) {
		int mid = (l + r) / 2;
		vector<int> res = ask(mid);
		if (res[0] + res[1] == 0) {
			return mid;
		}
		if (res[1] > 0) {
			l = mid + 1;
		}
		else {
			r = mid - 1;
		}
	}

	vector<int> fin = ask(r);

	if (fin[0] + fin[1] == 0) {
		return r;
	}
	return l;

}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.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 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Incorrect 0 ms 344 KB answer is not correct
12 Halted 0 ms 0 KB -