oj.uz

Submission #604205

# Submission time Handle Problem Language Result Execution time Memory
604205 2022-07-24T20:50:43 Z pirhosig The Big Prize (IOI17_prize) C++17
20 / 100
 1 ms 336 KB 
#include "prize.h"

int find_best(int n) {
	int low = 0;
	int upp = n - 1;
	while (low < upp) {
		int mid = (low + upp) / 2;
		auto a = ask(mid);
		if (a[0] + a[1] == 0) return mid;
		if (a[0]) upp = mid - 1;
		else low = mid + 1;
	}
	return low;
}

Subtask #1
20.0 / 20.0

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