oj.uz

Submission #1083966

# Submission time Handle Problem Language Result Execution time Memory
1083966 2024-09-04T16:34:12 Z mindiyak The Big Prize (IOI17_prize) C++14
20 / 100
 1 ms 432 KB 
#include "prize.h"

using namespace std;

int find_best(int n) {
	int l = 0,r = n-1;

	while(l<r){
		int mid = (l+r)/2;
		vector<int> arr = ask(mid);

		if(arr[0] == 0 && arr[1] == 0)return mid;

		if(arr[0] >= 1)r = mid-1;
		else l = mid+1;
	}	

	return l;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 80.0

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