oj.uz

Submission #722422

# Submission time Handle Problem Language Result Execution time Memory
722422 2023-04-11T23:09:12 Z perohero The Big Prize (IOI17_prize) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
#include "prize.h"

using namespace std;

typedef long long ll;

int find_best(int N) {
    int l = 1, r = N;
    while (l < r) {
        int mid = (l + r) / 2;
        vector <int> cnt = ask(mid);
        if (cnt[0] == 0 && cnt[1] == 0) {
            return mid;
        } else if (cnt[0] < cnt[1]) {
            l = mid + 1;
        } else {
            r = mid;
        }
    }
    return l;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Incorrect 1 ms 272 KB answer is not correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Incorrect 1 ms 288 KB answer is not correct
7 Halted 0 ms 0 KB -