oj.uz

Submission #775074

# Submission time Handle Problem Language Result Execution time Memory
775074 2023-07-06T07:22:12 Z t6twotwo The Big Prize (IOI17_prize) C++17
0 / 100
 6 ms 296 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int N) {
    for (int i = 0; i < 500; i++) {
        vector<int> t = ask(i);
        if (t[0] + t[1] == 0) {
            return i;
        }
    }
    int x = 500;
    while (1) {
        vector<int> t = ask(x);
        if (t[0] + t[1] == 0) {
            return x;
        }
        int lo = x, hi = N - 1;
        while (lo < hi) {
            int mi = (lo + hi + 1) / 2;
            vector<int> v = ask(mi);
            if (v[0] >= t[0]) {
                lo = mi;
            } else {
                hi = mi - 1;
            }
        }
        x = lo + 1;
    }
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 292 KB Integer 200000 violates the range [0, 199999]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 296 KB Integer 200000 violates the range [0, 199999]
2 Halted 0 ms 0 KB -