제출 #869521

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

prize

#include "prize.h"
#include <iostream>
using namespace std;
vector <int> a;
int maxs;
int find_prize(int l, int r, int bigl, int bigr) {
    int mid=(l+r)/2;
    while (mid<=r) {
        a=ask(mid);
        if (a[0]+a[1]==0) return mid;
        if (a[0]+a[1]==maxs) break;
        mid++;
    }
    int ans=-1;
    if (mid<=r && a[0]+1<=bigr) {
        ans=find_prize(mid+1,r,a[0]+1,bigr);
        if (ans!=-1) return ans;
    }
    mid=(l+r)/2-1;
    while (mid>=l) {
        a=ask(mid);
        if (a[0]+a[1]==0) return mid;
        if (a[0]+a[1]==maxs) break;
    }
    if (mid>=l && a[0]>=bigl) {
        ans=find_prize(l,mid-1,bigl,a[0]);
        if (ans!=-1) return ans;
    }
    return ans;
}
int find_best(int n) {
    for (int i=0;i<700;i++) {
        a=ask(rand()%n);
        maxs=max(maxs,a[0]+a[1]);
    }
    int ans=find_prize(0,n-1,1,maxs);
    return ans;
}

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