제출 #73398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73398		hamzqq9	커다란 상품 (IOI17_prize)	C++14	97.57 / 100	74 ms	2460 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>
#define ii pair<int,int>
#define st first
#define nd second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;

set<int> s;
int bg[200005][2];

int find_best(int n) {
	
	stack<ii> q;

	q.push({0,n-1});

	while(!q.empty()) {

		ii query=q.top();

		q.pop();

		if(query.st>query.nd) continue ;

		vector<int> res;

		int mid=(query.st+query.nd)/2;

		res=ask(mid);

		if(res[0]==0 && res[1]==0) return mid;

		bg[mid][0]=res[0];
		bg[mid][1]=res[1];

		auto rnx=s.lower_bound(mid);
		auto lnx=s.lower_bound(mid);

		if(res[1]) {

			if(rnx==s.end() || bg[mid][1]>bg[*rnx][1] || bg[*rnx][0]>bg[mid][0]) q.push({mid+1,query.nd});

		}

		if(res[0]) {

			if(lnx==s.begin() || bg[mid][1]<bg[*prev(lnx)][1] || bg[*prev(lnx)][0]<bg[mid][0]) q.push({query.st,mid-1});

		}

		s.insert(mid);

	}

	assert(0);

}

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