제출 #446864

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
446864		wiwiho	A Difficult(y) Choice (BOI21_books)	C++14	20 / 100	302 ms	456 KiB

books

#include <bits/stdc++.h>

#include "books.h"

#define eb emplace_back

using namespace std;

typedef long long ll;

void ans(int st, int k){
    vector<int> v(k);
    for(int i = 0; i < k; i++) v[i] = st + i;
    answer(v);
}

void solve(int n, int k, ll A, int S){
    assert(n == S);
    
    vector<ll> x(n + 1);
    for(int i = 1; i <= n; i++){
        x[i] = skim(i);
    }

    ll sum = 0;
    for(int i = 1; i <= k; i++) sum += x[i];
    if(sum > 2 * A) impossible();
    if(sum >= A) ans(1, k);

    int i;
    for(i = k + 1; i <= n && x[i] < A; i++){
        sum -= x[i - k];
        sum += x[i];
        if(sum >= A){
            assert(sum <= 2 * A);
            ans(i - k + 1, k);
        }
    }

    if(i == n + 1) impossible();
    sum = x[i];
    for(int j = 1; j < k; j++) sum += x[j];
    if(sum <= 2 * A){
        vector<int> v;
        for(int j = 1; j < k; j++) v.eb(j);
        v.eb(i);
        answer(v);
    }

    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