oj.uz

답안 #1060827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060827 2024-08-16T01:41:59 Z ArthuroWich 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 344 KB 
#include"prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
	vector<int> res;
	int l = 0, r = n-1;
	while(l < r) {
		int m = (l+r)/2;
		res = ask(m);
		if (res[0] == res[1] && res[0] == 0) {
			return m;
		} else if (res[0] <= res[1]) {
			l = m+1;
		} else if (res[0] > res[1]) {
			r = m-1;
		}
	}
	for (int i = l; i <= min(r, n-1); i++) {
		res = ask(i);
		if (res[0] == res[1] && res[0] == 0) {
			return i;
		}
	}
	return 0;
}

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 1 ms 340 KB Output is correct
4 Correct 0 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 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 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 0 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 1 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 0 ms 340 KB Output is correct
11 Incorrect 1 ms 344 KB answer is not correct
12 Halted 0 ms 0 KB -