제출 #524760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
524760		CSQ31	The Big Prize (IOI17_prize)	C++17	20 / 100	107 ms	10528 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int num = 0;
#define sz(a) (int)(a.size());
vector<int>res[200000];
int cnt = 0;
vector<int> askk(int v){
	cnt++;
	assert(cnt<=9999);
	return ask(v);
}
int solve(int l,int r,int lf = 0,int rg = 0){
	if(l > r)return -1;
	int mid = (l+r)/2;
	int il = mid;
	int ir = mid;
	int cur = mid;
	int i = 0;
	while(true){
		if(cur < l || cur > r)break;
		res[cur] = askk(cur);
		if(!res[cur][0] && !res[cur][1])return cur;
		else if(res[cur][0]+res[cur][1] == num)break;
		if(i%2 == 0){
			ir++;
			cur = ir;
		}else{
			il--;
			cur = il;
		}
		i++;
	}
	if(cur < l || cur > r)return -1;
	if(il-1 >= l && res[cur][0]-lf > 0){
	    int c = solve(l,il-1,lf,res[cur][1]);
	    if(c!=-1)return c;
	}
	if(ir+1<=r && res[cur][1] - rg > 0){
		int c = solve(ir+1,r,res[cur][0],rg);
		if(c!=-1)return c;
	}
	return -1;
		
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int find_best(int n) {
	for(int i=0;i<50;i++){ //random until find dao biggest guy 
		int c = uniform_int_distribution<int>(0,n-1)(rng); 
		vector<int>res = askk(c);
		num = max(num,res[0]+res[1]);
		if(!res[0] && !res[1])return c;
	}
	//d&c to try all small guys since < #small guys < sqrt(n)
	return solve(0,n-1);
}

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