제출 #255011

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
255011		tinjyu	커다란 상품 (IOI17_prize)	C++14	98.21 / 100	67 ms	1920 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int m,ball=0,a[200005][2],ans=-1;
int find(int x)
{
	if(a[x][0]==-1)
	{
		std::vector<int> res = ask(x);
		a[x][0]=res[0];
		a[x][1]=res[1];
	}
	return 0;
}
int solve(int s,int e,int num){
	//cout<<s<<" "<<e<<endl;
	if(s>=e-1)return 0;
	if(ans!=-1)return 0;
	int ne,ns;
	ne=(s+e)/2,ns=(s+e)/2;
	while(ns<e)
	{
		find(ns);
		if(a[ns][0]+a[ns][1]==0)
		{
			ans=ns;
			return 0;
		}
		if(a[ns][0]+a[ns][1]!=ball)ns++;
		else break;
	}
	while(s<ne)
	{
		find(ne);
		if(a[ne][0]+a[ne][1]==0)
		{
			ans=ne;
			break;
		}
		if(a[ne][0]+a[ne][1]!=ball)ne--;
		else break;
	}
	//cout<<ne<<" "<<ns<<endl;
	int tmp=rand()%2;
	if(tmp==1)
	{
		if(a[ns][1]!=a[e][1])solve(ns,e,a[ns][1]-a[e][1]);
		if(a[s][0]!=a[ne][0])solve(s,ne,a[ne][0]-a[s][0]);
	}
	else
	{
		if(a[s][0]!=a[ne][0])solve(s,ne,a[ne][0]-a[s][0]);
			if(a[ns][1]!=a[e][1])solve(ns,e,a[ns][1]-a[e][1]);

	}
}
int find_best(int n) {
	for(int i=0;i<n;i++)
	{
		a[i][0]=-1;
		a[i][1]=-1;
	}
	for(int t = 0; t < 450; t++) {
		long long int i=rand();
		i%=n;
		find(i);
		//cout<<a[i][0]<<" "<<a[i][1]<<endl;
		if(a[i][0]+a[i][1]==0)
		{
			ans=i;
			break;
		}
		if(a[i][0] + a[i][1] > ball)
		{
			m=i;
			ball=a[i][0]+a[i][1];
		}
	}
	if(ans!=-1)return ans;
 
//	cout<<m<<endl;
	int start=0,end=n-1;
	while(true)
	{
		find(start);
		if(a[start][0]+a[start][1]==0)ans=start;
		if(a[start][0]+a[start][1]!=ball)start++;
		else break;
	}
	while(true)
	{
		find(end);
		if(a[end][0]+a[end][1]==0)ans=end;
		if(a[end][0]+a[end][1]!=ball)end--;
		else break;
	}
	if(ans!=-1)return ans;
	//cout<<start<<" "<<end<<endl;
	if(a[start][0]!=a[m][0])solve(start,m,a[m][0]-a[start][0]);
	if(a[m][1]!=a[end][1])solve(m,end,a[m][1]-a[end][1]);
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'int solve(int, int, int)':
prize.cpp:56:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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