Submission #407628

#	Time	Username	Problem	Language	Result	Execution time	Memory
407628		Kevin_Zhang_TW	커다란 상품 (IOI17_prize)	C++17	20 / 100	3056 ms	8456 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;

// 0-based bit
struct bit {
	int n;
	vector<int> v;
	void add(int i, int d) {
		for (++i;i <= n;i += i&-i)
			v[i] += d;
	}
	int kth(int k) {
		int res = 0;
		++k;
		for (int i = 1<<19;i > 0;i>>=1) {
			if ( (res|i) > n ) continue;
			if (v[res|i] < k) {
				k -= v[res|=i];
			}
		}
		return res;
	}
	int operator()(int i) { return kth(i); }
	bit (int _n) {
		n = _n + 10;
		v.resize(n);
		for (int i = 0;i < n;++i)
			add(i, 1);
	}
};

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) {
	bit T(n);

	int cnt = 1, l = 0, r = n-1, sz = n, m;

	bool bg = false;

	while (sz > 1) {
		while (sum(T(0)) < cnt) {
			if (sum(T(0)) == 0) return T(0);
			T.add(T(0), -1);
			--sz;
		}
		cnt = sum(T(0));

		l = 0, r = sz-1;

		while (l < r) {
			m = (l + r >> 1) + 1;
			while (sum(T(m)) < cnt) {
				if (sum(T(m)) == 0) return T(m);
				T.add(T(m), -1), --sz;
				chmin(m, sz-1);
				chmin(r, sz-1);
			}
			if (sum(T(m)) > cnt) {
				cnt = sum(T(m));
				bg = true;
				break;
			}
			if (qry(T(m))[0] > qry(T(0))[0]) r = m-1;
			else l = m;
		}
		if (bg) continue;
		for (int i = l;i >= 0;--i) 
			T.add(T(i), -1), --sz;
	}
	return T(0);
}

Compilation message (stderr)

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

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