oj.uz

답안 #647429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647429 2022-10-02T14:35:34 Z Iwanttobreakfree 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 336 KB 
#include "prize.h"
#include <vector>
#include <iostream>

using namespace std;

int find_best(int n) {
	int l = 0, r = n-1;
    while (l <= r) {
        int mid = (r+l)/2;
        vector<int> res = ask (mid);
        if (res[0] < res[1]) l = mid+1;
        else if (res[0] == res[1]) return mid;
        else r = mid-1;
    }
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 272 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 276 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 -