제출 #470639

#제출 시각아이디문제언어결과실행 시간메모리
470639Carmel_Ab1커다란 상품 (IOI17_prize)C++17
0 / 100
6 ms416 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int>vi;

//#include "grader.cpp"

int find_best(int n) {

    int sz=450;
    vi prv={-1,-1};
    for(int i=0; i<n; i+=sz){
        vi s=(prv[0]!=-1?ask(i):prv),e=ask(min(n-1,i+sz));
        if(s[0]!=e[0])
            continue;
        for(int j=i; j<=min(n-1,i+sz); j++) {
            vi v=ask(i);
            if(v[0]==0 && v[1]==0)
                return i;
        }
        prv=e;
    }
    assert(0);
    return -1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...