제출 #136051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
136051		JustasZ	커다란 상품 (IOI17_prize)	C++14	20 / 100	64 ms	400 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
/*vector<int> ask(int i)
{
	cout << "? " << i << endl;
	vector<int>a(2);
	cin >> a[0] >> a[1];
	return a;
}*/
int find_best(int n)
{
	vector<int>a, b;
	int mx = 0;
	for(int i = 0; i < 500; i++)
	{
		a = ask(i);
		mx = max(mx, a[0] + a[1]);
	}
	for(int i = 0; i < n; i += 500)
	{
		int j = min(i + 500 - 1, n - 1);
		a = ask(i);
		while(a[0] + a[1] != mx)
		{
			if(a[0] + a[1] == 0)
				return i;
			i++;
			if(i > j)
				break;
			a = ask(i);
		}
		a = ask(j);
		while(a[0] + a[1] != mx)
		{
			if(a[0] + a[1] == 0)
				return j;
			j--;
			if(j < i)
				break;
			a = ask(j);
		}
		if(i <= j)
		{
			a = ask(i), b = ask(j);
			int between = b[0] - a[0];
			if(between != 0)
			{
				int it = i + 1;
				while(it < j && between > 0)
				{
					a = ask(it);
					if(a[0] + a[1] != mx)
					{
						between--;
						if(a[0] + a[1] == 0)
							return it;
					}
					else
					{
						int l = it, r = j - 1;
						while(l < r)
						{
							int mid = (l + r) / 2;
							b = ask(mid);
							if(b[0] + b[1] != mx)
								r = mid;
							else
							{
								if(b[0] > a[0])
									r = mid - 1;
								else
									l = mid + 1;
							} 
						}
						it = l;
						a = ask(it);
						--between;
						if(a[0] + a[1] == 0)
							return it;
					}
					++it;
				}
			}
		}
	}
}

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

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

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