제출 #406918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406918		Peti	커다란 상품 (IOI17_prize)	C++17	20 / 100	27 ms	328 KiB

prize

#include <bits/stdc++.h>
#include "prize.h"

using namespace std;

const int bont = 447;

int find_best(int n) {
    int s = bont+1, ert = 0;

    for(int i = 0; i < min(n, bont+1); i++){
        vector<int> ans = ask(i);
        if(ans[0]+ans[1] == 0) return i;
        ert = max(ert, ans[0]+ans[1]);
    }

    while(s < n){
        vector<int> ans = ask(s);
        if(ans[0]+ans[1] == 0)
            return s;
        while(ans[0]+ans[1] != ert){
            s++;
            ans = ask(s);
            if(ans[0]+ans[1] == 0)
                return s;
        }

        int e = min(s+bont, n-1);
        vector<int> ans2 = ask(e);
        if(ans2[0]+ans2[1] == 0)
            return e;
        while(s < e && ans2[0]+ans2[1] != ert){
            e--;
            ans2 = ask(e);
            if(ans2[0]+ans2[1] == 0)
                return e;
        }

        while(s+1 < e && ans[0] < ans2[0]){
            int l = s, r = e;
            while(l+1 < r){
                int m = (l+r)/2;
                vector<int> ans3 = ask(m);

                if(ans3[0]+ans3[1] == 0) return m;

                if(ans3[0]+ans3[1] != ert || ans3[0] != ans[0])
                    r = m;
                else
                    l = m;
            }
            s = l+1;
            ans = ask(s);
            if(ans[0]+ans[1] == 0) return s;
            while(s < e && ans[0]+ans[1] != ert){
                s++;
                ans = ask(s);
                if(ans[0]+ans[1] == 0)
                    return s;
            }
        }

        s = min(s+bont, n-1)+1;
    }
	return -1;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80