oj.uz

답안 #298461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
298461 2020-09-12T22:53:09 Z medk 커다란 상품 (IOI17_prize) C++14
20 / 100
 63 ms 384 KB 
#include <bits/stdc++.h>
#include "prize.h"

#define ll long long
#define pb push_back
#define x first
#define y second
#define sz(u) (int)(u.size())
#define all(u) u.begin(),u.end()

using namespace std;

vector<int> tmp;

int find_best(int N){
    int ptr=0;
    int curall=1, curR=1;
    while(1){
        tmp=ask(ptr);
        curall=tmp[0]+tmp[1];
        if(curall==0) break;
        curR=tmp[1];
        int l=0,r=N;
        while(l<r){
            int md=(l+r)/2;
            tmp=ask(md);
            if(tmp[0]+tmp[1]!=curall || tmp[1]!=curR) r=md;
            else l=md+1;
        }
        ptr=l;
    }
    return ptr;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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