oj.uz

답안 #738474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
738474 2023-05-08T20:08:29 Z Elvin_Fritl 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;
#include "prize.h"

int find_best(int n) {
	int l=0,r=n-1;
	while(l<=r){
        int mid=(l+r)>>1;
        vector<int> a = ask(mid);
        if(a[0] == a[1] && a[0] == 0){
            return mid;
        }
        if(a[0]==0){
            l=mid+1;
        }
        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 292 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 296 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 292 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 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 288 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 1 ms 336 KB answer is not correct
12 Halted 0 ms 0 KB -