Submission #292973

#	Time	Username	Problem	Language	Result	Execution time	Memory
292973		luciocf	커다란 상품 (IOI17_prize)	C++14	90 / 100	104 ms	384 KiB

prize

#include <bits/stdc++.h>
#include "prize.h"

#define ff first
#define ss second

using namespace std;

typedef pair<int, int> pii;

const int maxn = 2e5+10;

int qtd[10];
pii v[maxn];

pii get(int i)
{
	vector<int> v = ask(i);

	return {v[0], v[1]};
}

int find_best(int n)
{
	int ind = 0;
	for (int i = 0; i < min(n, 500); i++)
	{
		int v = get(i).ff+get(i).ss;

		if (v == 0) return i;

		if (v > qtd[1])
			qtd[1] = v, ind = i;
	}

	int ant = ind;
	pii v_ind = get(ind);

	for (int i = 1; i <= 500; i++)
	{
		int ini = ant+1, fim = n-1, ans;

		while (ini <= fim)
		{
			int mid = (ini+fim)/2;

			pii v = get(mid);

			if (v.ff+v.ss != qtd[1])
			{
				if (v.ff+v.ss == 0) return mid;

				ans = mid, fim = mid-1;
			}
			else if (v.ff-v_ind.ff-(i-1) > 0) fim = mid-1;
			else ini = mid+1;
		}

		ant = ans;
	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
   61 | }
      | ^
prize.cpp:41:7: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |   int ini = ant+1, fim = n-1, ans;
      |       ^~~

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