답안 #1018782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018782 2024-07-10T09:45:07 Z vjudge1 커다란 상품 (IOI17_prize) C++17
20 / 100
0 ms 428 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
#define lli long long int


int find_best(int n){
    vector<int>a(2);
    int x=0,y=n-1,z;
    while(x!=y){
        z=(x+y)/2;
        a=ask(z);
        if(a[0]==1){
            y=z-1;
        }
        else if(a[1]==1){
            x=z+1;
        }
        else{
            return z;
        }
    }
    return x;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 428 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 344 KB answer is not correct
12 Halted 0 ms 0 KB -