oj.uz

답안 #757736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
757736 2023-06-13T17:04:09 Z borisAngelov 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 336 KB 
#include "prize.h"

#include <iostream>
#include <vector>

using namespace std;

int find_best(int n)
{
    int l = 0;
    int r = n - 1;

    while (l <= r)
    {
        int mid = (l + r) / 2;

        vector<int> result = ask(mid);

        int l_ans = result[0];
        int r_ans = result[1];

        if (l_ans == 0 && r_ans == 0)
        {
            return mid;
        }

        if (l_ans == 1)
        {
            r = mid - 1;
        }
        else
        {
            l = mid + 1;
        }
    }

    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 276 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 1 ms 208 KB answer is not correct
12 Halted 0 ms 0 KB -