oj.uz

Submission #429480

# Submission time Handle Problem Language Result Execution time Memory
429480 2021-06-16T03:03:37 Z kwongweng The Big Prize (IOI17_prize) C++17
20 / 100
 2 ms 320 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n) {
	int l = 0; int r = n-1;
	while (r >= l){
		int mid = (l+r)/2;
		vector<int> res = ask(mid);
		if (res[0] + res[1] == 0) return mid;
		if (res[0] > 0) r = mid-1;
		if (res[1] > 0) l = mid+1;
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 2 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 264 KB Output is correct
6 Correct 1 ms 280 KB Output is correct
7 Correct 1 ms 280 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 272 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Incorrect 1 ms 276 KB answer is not correct
12 Halted 0 ms 0 KB -