oj.uz

Submission #282879

# Submission time Handle Problem Language Result Execution time Memory
282879 2020-08-25T06:16:22 Z Erkhemkhuu The Big Prize (IOI17_prize) C++17
20 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
#include <prize.h>
using namespace std;
#define ll int
#define pb push_back
#define mp make_pair
#define F first
#define S second
const ll N = 105;
ll find_best(ll n) {
    ll l, r, mid;
    l = 0; r = n;
    while(l + 1 < r) {
        mid = (l + r) / 2;
        vector <ll> asked = ask(mid);
        if(!asked[0] && !asked[1]) return mid;
        if(!asked[0] && asked[1]) l = mid;
        else r = mid;
    }
    return l;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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