Submission #531404

#	Time	Username	Problem	Language	Result	Execution time	Memory
531404		physics07	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	11 ms	308 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;
typedef long long ll;
ll adj[100001];
vector<int> ans;
void solve(int n, int k, ll a, int s) {
    for(int i=1; i<=n; i++) adj[i]=skim(i);
    int p=lower_bound(adj+1, adj+n+1, a)-adj;
    p--;
    if(p<=k-2) impossible();
    if(p==k-1) {
        ll sum=0;
        for(int i=1; i<=k; i++) {
            sum+=adj[i];
            ans.push_back(i);
        }
        int idx=k+1;
        while(idx<=n && sum<a) {
            sum-=adj[idx-1];
            sum+=adj[idx];
            ans.pop_back();
            ans.push_back(idx);
            idx++;
        }
        if(sum>=a && sum<=a*2) answer(ans);
        else impossible();
    }
    ll sum=0;
    for(int i=1; i<=k; i++) sum+=adj[k];
    int idx=k+1;
    while(idx<=min(p+1, n) && sum<a) {
        sum-=adj[idx-k];
        sum+=adj[idx];
        idx++;
    }
    if(sum<a || sum>a*2) impossible();
    for(int i=idx-k+1; i<=idx; i++) ans.push_back(i);
    answer(ans);
}

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