oj.uz

답안 #1061415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061415 2024-08-16T08:49:46 Z fv3 커다란 상품 (IOI17_prize) C++14
20 / 100
 1 ms 344 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 c = (l + r) / 2;
		auto val = ask(c);

		if (!val[0] && !val[1])
			return c;

		if (val[0])
			r = c - 1;
		else
			l = c + 1;
	}
	return l;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 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 1 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 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 344 KB answer is not correct
12 Halted 0 ms 0 KB -