oj.uz

답안 #712331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
712331 2023-03-18T15:14:37 Z josanneo22 커다란 상품 (IOI17_prize) C++17
20 / 100
 77 ms 296 KB 
#include "prize.h"
#include<bits/stdc++.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> tmp = ask(md);
		if (tmp[0] + tmp[1] == 0) {
			return md;
		}
		else if (tmp[0] == 0) {
			l = md + 1;
		}
		else if(tmp[1]==0) r = md - 1;
	}
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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