oj.uz

답안 #758418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
758418 2023-06-14T15:21:11 Z Andrey 커다란 상품 (IOI17_prize) C++14
20 / 100
 1 ms 336 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 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 292 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 276 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 288 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 1 ms 292 KB answer is not correct
12 Halted 0 ms 0 KB -