제출 #414740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
414740		tengiz05	A Difficult(y) Choice (BOI21_books)	C++17	20 / 100	301 ms	968 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using i64 = long long;
void solve(int n, int k, i64 A, int s) {
    std::vector<i64> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = skim(i + 1);
    }
    for (int i = k - 1; i < n; i++) {
        i64 sum = 0;
        for (int j = i - k + 1; j <= i; j++) {
            sum += a[j];
        }
        if (sum >= A && sum <= 2 * A) {
            std::vector<int> ans;
            for (int j = i - k + 1; j <= i; j++) {
                ans.push_back(j + 1);
            }
            answer(ans);
            return;
        }
    }
    i64 min_sum = 0;
    for (int i = 0; i < k - 1; i++) min_sum += a[i];
    for (int i = k - 1; i < n; i++) {
        if (a[i] + min_sum >= A && a[i] + min_sum <= 2 * A) {
            std::vector<int> ans;
            for (int j = 0; j < k - 1; j++) {
                ans.push_back(j + 1);
            }
            ans.push_back(i + 1);
            answer(ans);
            return;
        }
    }
    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