oj.uz

답안 #379070

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379070 2021-03-17T08:59:32 Z blue 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 492 KB 
#include "prize.h"
#include <vector>
using namespace std;

int diamond_search(int a, int b)
{
    if(a == b) return a;
    int m = (a+b)/2;

    vector<int> X = ask(m);

    if(X[0] == 0 && X[1] == 0) return m;
    else if(X[0] == 1) return diamond_search(a, m-1);
    else return diamond_search(m+1, b);
}

int find_best(int n)
{
    return diamond_search(1, n);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 396 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Incorrect 1 ms 364 KB Integer 200000 violates the range [0, 199999]
12 Halted 0 ms 0 KB -