oj.uz

Submission #1083964

# Submission time Handle Problem Language Result Execution time Memory
1083964 2024-09-04T16:30:55 Z mindiyak The Big Prize (IOI17_prize) C++14
0 / 100
 64 ms 344 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;
	}	

	return l;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 64 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -