oj.uz

답안 #297901

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297901 2020-09-12T06:33:08 Z Autoratch 커다란 상품 (IOI17_prize) C++14
20 / 100
 1 ms 384 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 m = (l+r)/2;
        vector<int> res = ask(m);
        if(res[0]) r = m-1;
        else if(res[1]) l = m+1;
        else return m;
    }
    return l;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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