oj.uz

Submission #104480

# Submission time Handle Problem Language Result Execution time Memory
104480 2019-04-07T02:36:45 Z dupreez The Big Prize (IOI17_prize) C++14
20 / 100
 3 ms 504 KB 
#include "prize.h"
using namespace std;

int find_best(int n) {
	int lb = 0, rb = n;
	while (rb - lb > 1) {
		int md = (lb + rb) / 2;
		vector<int> a;
		a = ask(md);
		if (a[0] + a[1] == 0)return md;
		if (a[0]>0)rb = md;
		else lb = md;
	}
	return lb;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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