Submission #738492

#	Time	Username	Problem	Language	Result	Execution time	Memory
738492		Elvin_Fritl	커다란 상품 (IOI17_prize)	C++17	0 / 100	61 ms	300 KiB

prize

#include <bits/stdc++.h>
using namespace std;
#include "prize.h"

const int mx=2e6+5;

int tree[mx*4],say=0;

int min_segment(int l,int r){
    if(l>r){
        return -1;
    }
    int mid=(l+r)>>1;
    vector<int>a = ask(mid);
    if(a[0] == 0 && a[1] == 0){
        return mid;
    }
    if(l==r){
        return -1;
    }
    int tmp1=min_segment(l,mid-1);
    if(tmp1!=-1){
        return tmp1;
    }
    int tmp2=min_segment(mid+1,r);
    if(tmp2!=-1){
        return tmp2;
    }
    return -1;
}

int find_best(int n) {
	return max(0,min_segment(0,n-1));
}

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