oj.uz

답안 #137298

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
137298 2019-07-27T12:28:16 Z Lawliet 커다란 상품 (IOI17_prize) C++14
20 / 100
 2 ms 504 KB 
#include "prize.h"

using namespace std;

int find_best(int n) 
{
	int l = 0, r = n - 1;

	while(l < r)
	{
		int m = (l + r)/2;

		vector<int> aux = ask( m );

		if(aux[0] + aux[1] == 0)  return m;

		if(aux[0] == 1) r = m - 1;
		else l = m + 1; 
	}

	return l;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 308 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Incorrect 2 ms 308 KB answer is not correct
12 Halted 0 ms 0 KB -