제출 #775758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775758		APROHACK	커다란 상품 (IOI17_prize)	C++14	0 / 100	4 ms	208 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int sumMax = 0;
struct range{
	int ff, ss, izq, der;
};

bool confirm(vector<int>&t){
	return t[0] + t[1] == 0;
}
int suma(vector<int>&t){return t[0] + t[1];}
int find_best(int n) {
	vector<int>t;
	for(int i = 0 ; i < 500 ; i ++){
		t = ask(i);
		sumMax = max(sumMax, suma(t));
		if(confirm(t))return i;
	}
	queue<range>cola;
	cola.push({500, n-1, sumMax, 0});
	while(!cola.empty()){
		range cur = cola.front();
		cola.pop();
		if(cur.ff > cur.ss)continue;
		if(cur.ff == cur.ss){
			t = ask(cur.ff);
			if(confirm(t))return cur.ff;
		}
		int midd = (cur.ff + cur.ss)/2, toL, k;
		t = ask(midd);
		k = midd;
		toL = midd-1;
		bool thereIsR = true;
		while(suma(t) != sumMax){
			if(confirm(t))return k;
			k++;
			if(k > cur.ss){
				thereIsR = false;
				break;
			}
			t = ask(k);
		}
		if(cur.der - t[1] > 0 and thereIsR and k+1 <= cur.ss){
			cola.push({k+1, cur.ss});
		}
		if(t[0] - cur.izq > 0 and toL >= cur.ff)cola.push({cur.ff, toL});
		//if(t[0] > 0 and toL >= cur.ff)cola.push({cur.ff, toL});
	}
	return 0;
}

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