제출 #668700

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668700		a_aguilo	커다란 상품 (IOI17_prize)	C++14	20 / 100	90 ms	1892 KiB

prize

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

using namespace std;

vector<int> LeftVal, RightVal;

int binarySearch(int left, int right){
    int ans = -1;
    if(left+1 >= right) return -1;
    int mid = left + (right - left)/2;
    vector<int> trial = ask(mid);
    LeftVal[mid] = trial[0];
    RightVal[mid] = trial[1];
    if(trial[0] +trial[1] == 0) return mid;
    if(trial[0] > 0) ans = max(ans, binarySearch(left, mid));
    if(trial[1] > 0) ans = max(ans, binarySearch(mid, right));
    return ans;
}

int find_best(int n) {
    LeftVal = vector<int>(n, -1);
    RightVal = vector<int>(n, -1);
    vector<int> trial = ask(0);
    LeftVal[0] = trial[0];
    RightVal[0] = trial[1];
    if (LeftVal[0] + RightVal[0] == 0) return 0;
    trial = ask(n-1);
    LeftVal[n-1] = trial[0];
    RightVal[n-1] = trial[1];
    if (LeftVal[n-1] + RightVal[n-1] == 0) return n-1;
    return binarySearch(0, n-1);
}

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