oj.uz

Submission #1075567

# Submission time Handle Problem Language Result Execution time Memory
1075567 2024-08-26T07:44:42 Z NeroZein The Big Prize (IOI17_prize) C++17
0 / 100
 61 ms 344 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

const int B = 1000;

int find_best(int n) {
	for (int i = 0; i < n; ++i) {
		vector<int> res = ask(i); 
		if (res[0] + res[1] == 0) {
			return i; 
		}
		if (res[0] + res[1] >= B) {
			int l = i, r = n - 1;
			while (l < r) {
				int mid = (l + r + 1) >> 1;
				vector<int> res2 = ask(mid);
				if (res2[1] < res[1]) {//I skipped a more valuable person
					r = mid - 1;
				} else {
					l = mid; 
				}
			}
			i = l;
		}
		//else I will just do i++
	}
	assert(false);	
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 80.0

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