oj.uz

Submission #1060876

# Submission time Handle Problem Language Result Execution time Memory
1060876 2024-08-16T03:54:30 Z onbert The Big Prize (IOI17_prize) C++17
20 / 100
 1 ms 428 KB 
#include "prize.h"
#include <bits/stdc++.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> val = ask(mid);
        if (val[0] + val[1]==0) return mid;
        if (val[0] == 1) r = mid-1;
        else l = mid+1;
    }
    return l;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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