제출 #408592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
408592		Kevin_Zhang_TW	커다란 상품 (IOI17_prize)	C++17	96.17 / 100	72 ms	7604 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];
	return mem[id] = ask(id);
}
 
int sum(int id) {
	return qry(id)[0] + qry(id)[1];
}
 
int find_best(int n) {
 
	int cnt = 1, m, h = 0;
 
	set<int> small;

	while (h < n) {
		while (sum(h) < cnt) {
			if (sum(h) == 0) return h;
			++h;
		}
		cnt = sum(h);
 
		int l = h;

		while (small.size() && *small.begin() <= l)
			small.erase(small.begin());

		for (int j = 1<<10;j > 0;j >>= 1) {
			if (l + j >= n || small.size() && l + j >= *small.begin()) continue;
			int m = l + j;

			if (sum(m) > cnt) {
				cnt = sum(m);
				break;
			}
			if (sum(m) == cnt && qry(m)[0] == qry(h)[0])
				l = m;

			if (sum(m) < cnt) {
				small.insert(m);
			}

			if (sum(m) == 0) return m;
		}
		if (sum(h) != cnt) continue;
		h = l + 1;
	}
	assert(false);
}

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:52:35: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   52 |    if (l + j >= n || small.size() && l + j >= *small.begin()) continue;
      |                      ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
prize.cpp:35:15: warning: unused variable 'm' [-Wunused-variable]
   35 |  int cnt = 1, m, h = 0;
      |               ^

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