oj.uz

Submission #263446

# Submission time Handle Problem Language Result Execution time Memory
263446 2020-08-13T17:04:09 Z jairRS The Big Prize (IOI17_prize) C++17
20 / 100
 1 ms 504 KB 
#include "prize.h"
using namespace std;

int find_best(int n)
{
	int lo = 0, hi = n - 1;
	while (true)
	{
		int mid = (hi + lo) / 2;
		vector<int> res = ask(mid);
		if (res[0] == res[1])
		{
			return mid;
		}
		else if (res[0] > res[1])
		{
			hi = mid - 1;
		}
		else
		{
			lo = mid + 1;
		}
	}
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 368 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 356 KB Output is correct
7 Correct 1 ms 372 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 1 ms 356 KB Output is correct
10 Correct 1 ms 256 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 368 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 372 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Incorrect 1 ms 256 KB answer is not correct
12 Halted 0 ms 0 KB -