Submission #961417

#	Time	Username	Problem	Language	Result	Execution time	Memory
961417		steveonalex	A Difficult(y) Choice (BOI21_books)	C++17	45 / 100	41 ms	1364 KiB

books

#include <bits/stdc++.h>

#include "books.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n"){
        for(auto i: a) cout << i << separator;
        cout << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

// int n;
// vector<ll> a;

void solve(int n, int k, long long A, int S) {
    vector<ll> a(n+1);
    int l = 0, r = n - k + 1;
    while(l < r){
        int mid = (l + r + 1) >> 1;
        if (a[mid] == 0) a[mid] = skim(mid);
        if (a[mid] * k + k * (k-1) / 2 <= 2 * A) l = mid;
        else r = mid - 1;
    }
    int x = l;
    if (x == 0){impossible(); return;}
    l = max(1, x - k), r = min(n, x + k);
    for(int i = l; i<=r; ++i){
        if (a[i] == 0) a[i] = skim(i);
    }

    for(int mask = 0; mask < MASK(r - l + 1); ++mask){
        if (pop_cnt(mask) != k) continue;
        vector<int> ans;
        for(int j = 0; j < r - l + 1; ++j) if (GETBIT(mask, j)) ans.push_back(l + j);

        ll sum = 0;
        for(int i: ans) sum += a[i];

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

 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

 
//     return 0;
// }

• 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