Submission #667390

#	Time	Username	Problem	Language	Result	Execution time	Memory
667390		someone	A Difficult(y) Choice (BOI21_books)	C++14	20 / 100	236 ms	720 KiB

books

#include "books.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
const int MAXN = 2e5 + 42;

ll val[MAXN];
 
ll get(int i) {
    if(val[i] == 0)
        val[i] = skim(i);
    return val[i];
}
 
void solve(int N, int K, ll A, int S) {
    for(int i = 1; i <= N; i++)
        get(i);
    int last = N+1;
    vector<int> ans;
    ll sum = 0;
    for(int i = 1; i <= K; i++)
        sum += val[i];
    for(int i = K; i > 0; i--) {
        for(int j = i; j < last; j++) {
            if(j == last-1 || sum + val[j+1] - val[i] > 2*A) {
                sum += val[j] - val[i];
                ans.push_back(j);
                last = j;
            }
        }
    }
    if(A <= sum && sum <= 2*A)
        answer(ans);
    else
        impossible();
}

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