oj.uz

Submission #430110

# Submission time Handle Problem Language Result Execution time Memory
430110 2021-06-16T11:30:56 Z moyindavid The Big Prize (IOI17_prize) C++17
20 / 100
 2 ms 336 KB 
#include <bits/stdc++.h>
#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> a; a.clear();
        a = ask(mid);
        if(a[0]==1) r = mid-1;
        else if(a[1]==1)l = mid+1;
        else return mid;
    }
    return l;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 264 KB Output is correct
2 Correct 2 ms 284 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 284 KB Output is correct
5 Correct 2 ms 264 KB Output is correct
6 Correct 1 ms 264 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct

Subtask #2
0 / 80.0

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