oj.uz

답안 #1073449

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073449 2024-08-24T14:54:01 Z vjudge1 커다란 상품 (IOI17_prize) C++17
20 / 100
 52 ms 432 KB 
#include "prize.h"
#include<bits/stdc++.h>

using namespace std;

typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;
typedef pair<char, int> ci;
typedef pair<string, int> si;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
#define pb push_back
#define fi first
#define se second
#define whole(v) v.begin(), v.end()
#define rwhole(v) v.rbegin(), v.rend()
#define inf INT_MAX/2
#define fro front

int find_best(int n) {
    int lo = -1;
    int hi = n+1;
    int mid;
    int b = 1;
    while(b){
        mid = lo + (hi - lo)/2;
        vector<int> x = ask(mid);
        if(x[0] == 0 && x[1] == 0){
            b = 0;
            continue;
        }
        if(x[0] > 0){
            hi = mid;
        }else if(x[1] > 0){
            lo = mid;
        }
    }
    return mid;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 424 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 428 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 424 KB Output is correct
9 Correct 0 ms 428 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Incorrect 52 ms 432 KB Incorrect
12 Halted 0 ms 0 KB -