제출 #987234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
987234		VMaksimoski008	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	8 ms	704 KiB

books

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

using namespace std;
using ll = long long;

void solve(int N, int K, ll A, int S) {
    if(N == S) {
        vector<ll> v = { 0 };
        for(int i=1; i<=N; i++) v.push_back(skim(i));
        
        ll sum1 = 0;
        for(int i=1; i<=K; i++) {
            sum1 += v[i];
            if(sum1 > 2 * A) {
                impossible();
                return ;
            }
        }

        sum1 = 0;
        for(int i=N; i>=N-K+1; i--) {
            sum1 += v[i];
            if(sum1 > A) break;
            if(i == N - K + 1 && sum1 < A) impossible();
        }

        sum1 = 0;
        for(int i=1; i<=K; i++) sum1 += v[i];

        if(sum1 >= A && sum1 <= 2 * A) {
            vector<int> ans;
            for(int i=1; i<=K; i++) ans.push_back(i);
            answer(ans);
        }

        for(int i=2; i+K-1<=N; i++) {
            sum1 -= v[i-1];
            sum1 += v[i+K-1];
            if(sum1 > 2 * A) break;

            if(sum1 >= A && sum1 <= 2 * A) {
                vector<int> ans;
                for(int j=i; j<=i+K-1; j++) ans.push_back(j);
                answer(ans);
            }
        }

        for(int i=K; i<=N; i++) {
            if(v[i] >= A) {
                ll sum = 0;
                for(int j=1; j<=K-1; j++) sum += v[j];
                if(sum + v[i] >= A && sum + v[i] <= 2 * A) {
                    vector<int> ans;
                    for(int j=1; j<=K-1; j++) ans.push_back(i);
                    ans.push_back(i);
                    answer(ans);
                }
                break;
            }
        }

        impossible();
        return ;
    }
}

• 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