oj.uz

Submission #790672

# Submission time Handle Problem Language Result Execution time Memory
790672 2023-07-23T05:12:04 Z peteza The Big Prize (IOI17_prize) C++14
20 / 100
 83 ms 1156 KB 
#include "prize.h"

int b_search(int l, int r) {
	int mid = (l+r) >> 1;
	std::vector<int> res = ask(mid);
	if(!res[0] && !res[1]) return mid;
	else if(res[0]) return b_search(l, mid-1);
	else return b_search(mid+1, r);
}

int find_best(int n) {
	return b_search(0, n-1);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 0 ms 268 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 1 ms 296 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 292 KB Output is correct
8 Correct 0 ms 292 KB Output is correct
9 Correct 0 ms 288 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 83 ms 1156 KB Incorrect
12 Halted 0 ms 0 KB -