Submission #657571

#	Time	Username	Problem	Language	Result	Execution time	Memory
657571		baojiaopisu	A Difficult(y) Choice (BOI21_books)	C++14	100 / 100	2 ms	336 KiB

books

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

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

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

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

ll w[N];

void solve(int n, int k, ll A, int S) {
	int l = 1, r = n, pos = n + 1;
	while(l <= r) {
		int mid = (l + r) >> 1;
		w[mid] = skim(mid);
		if(w[mid] >= A) {
			pos = mid;
			r = mid - 1;
		} else l = mid + 1;
	}

	if(pos < k) {
		impossible();
		return;
	}
	for(int i = 1; i < k; i++) w[i] = skim(i);

	if(pos <= n) {
		ll tot = w[pos];
		for(int i = 1; i < k; i++) tot += w[i];
		if(tot <= A * 2) {
			vector<int> ans;
			for(int i = 1; i < k; i++) ans.pb(i);
			ans.pb(pos);
			answer(ans);
			return;
		}
	}

	if(pos == k) {
		impossible();
		return;
	}
	ll tot = 0;
	if(!w[k]) w[k] = skim(k);
	for(int i = 1; i <= k; i++) tot += w[i];

	l = 1, r = pos - 1;
	while(true) {
		if(tot > A * 2) {
			impossible();
			return;
		}
		if(tot >= A) {
			vector<int> ans;
			for(int i = l; i <= k; i++) ans.pb(i);
			for(int i = r + 1; i < pos; i++) ans.pb(i);
			answer(ans); 
			return;
		}

		if(l > k || r <= k) {
			impossible();
			return;
		}

		tot -= w[l++];
		if(!w[r]) w[r] = skim(r);
		tot += w[r--];
	}

	impossible();
}

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