제출 #408559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
408559		Kevin_Zhang_TW	커다란 상품 (IOI17_prize)	C++17	20 / 100	107 ms	15280 KiB

prize

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
 
#include "prize.h"
 
const int MAX_N = 300010;
 
vector<int> qry(int id) {
	static vector<int> mem[MAX_N];
	if (mem[id].size()) return mem[id];
	static int cnt;
	assert(++cnt <= 9000);
	return mem[id] = ask(id);
}
 
int sum(int id) {
	return qry(id)[0] + qry(id)[1];
}

int solve(int L, int R, int &cnt) {
	while (L <= R) {
		if (sum(L) < cnt) {
			if (sum(L) == 0) return L;
			++L;
			continue;
		}
		if (L == R) continue;
		cnt = sum(L);
 
		int l = L, r = R, m;
 
		while (l < r) {
			m = (l + r >> 1)+1;
			if (sum(m) > cnt) {
				cnt = sum(m);
				break;
			}
			if (sum(m) == 0) return m;

			if (sum(m) < cnt) {
				assert(sum(m) > 0);
				int a = solve(L, m-1, cnt);
				if (a != -1) return a;
				int b = solve(m+1, R, cnt);
				if (b != -1) return b;
				return -1;
			}

			if (qry(m)[0] > qry(L)[0]) {
				r = m-1;
			}
			else 
				l = m;
		}
		if (sum(L) != cnt) continue;
		L = l + 1;
	}
	return -1;
}
 
int find_best(int n) {
	int c = 1;
	int res = solve(0, n-1, c);
	assert(res != -1);
	return res;
}

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

prize.cpp: In function 'int solve(int, int, int&)':
prize.cpp:47:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 |    m = (l + r >> 1)+1;
      |         ~~^~~

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