제출 #1313418

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313418		thieunguyenhuy	A Difficult(y) Choice (BOI21_books)	C++20	45 / 100	1 ms	1176 KiB

books

#ifndef hwe
	#include "books.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
	sort (ve.begin(), ve.end());
	ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
	return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
	return rng() % r;
}

const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

#ifdef hwe
ll skim(int i);
void answer(vector<int> v);
void impossible();
#endif

ll mem[N];

ll ask(int i) {
	if (mem[i] != 0) return mem[i];
	return mem[i] = skim(i);
}

void solve(int n, int k, ll A, int S) {
	for (int i = 1; i <= n; ++i) mem[i] = 0;
	ll sum = 0; vector<int> ans(k);
	for (int i = 1; i <= k; ++i) ans[i - 1] = i, sum += ask(i);

	if (sum > 2 * A) impossible();
	if (A <= sum && sum <= 2 * A) answer(ans);

	for (int i = k; i > 0; --i) {
		int pos = n - (k - i);
		ll newSum = sum - mem[i] + ask(pos);
		if (newSum <= 2 * A) {
			ans[i - 1] = pos, sum = newSum;
			if (newSum >= A) answer(ans);
		}
		else {
			int low = i + 1, high = pos, p = -1;
			while (low <= high) {
				int mid = (low + high) >> 1;
				if (sum - mem[i] + ask(mid) <= 2 * A) low = (p = mid) + 1;
				else high = mid - 1;
			}
			ans[i - 1] = p, sum = sum - mem[i] + ask(p);
			break;
		}
	}

	if (sum >= A && sum <= 2 * A) answer(ans);
	else impossible();
}

#ifdef hwe
signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);



	return 0;
}
#endif

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 10 / 10
• Subtask 4: 15 / 15
• Subtask 5: 0 / 15
• Subtask 6: 20 / 20
• Subtask 7: 0 / 20