oj.uz

Submission #434289

# Submission time Handle Problem Language Result Execution time Memory
434289 2021-06-20T21:31:58 Z Monchito The Big Prize (IOI17_prize) C++14
20 / 100
 1 ms 328 KB 
#include "prize.h"
using namespace std;

int bs(int n) {
    int l = 0, r = n-1, mid, ans=-1;

    while(r >= l) {
        mid = l + (r-l)/2;
        vector<int> a = ask(mid);

        if(a[0] == 0 && a[1] == 0) { ans = mid; break; }

        if(a[0] == 1) r = mid-1;
        else l = mid+1;
    }

    return ans;
}

int find_best(int n) {
	return bs(n);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 284 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 284 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 288 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 200 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 280 KB Output is correct
7 Correct 1 ms 264 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Incorrect 1 ms 272 KB Integer -1 violates the range [0, 199999]
12 Halted 0 ms 0 KB -