oj.uz

Submission #113520

# Submission time Handle Problem Language Result Execution time Memory
113520 2019-05-26T06:09:24 Z E869120 The Big Prize (IOI17_prize) C++14
20 / 100
 3 ms 432 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n) {
	int cl = 0, cr = n, cm;
	for (int i = 0; i < 22; i++) {
		cm = (cl + cr) / 2;
		vector<int> B = ask(cm);
		if (B[0] == 1) cr = cm;
		else cl = cm;
		if (B[0] + B[1] == 0) return cm;
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 308 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 304 KB Output is correct
4 Correct 2 ms 424 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 432 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 304 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Incorrect 2 ms 428 KB answer is not correct
12 Halted 0 ms 0 KB -