제출 #550335

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

books

#include <bits/stdc++.h>

#include "books.h"

using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

void solve(int n, int k, long long a, int s) {
    /*if (x[1] == 42) {
        impossible();
    } else {
        answer({1, 3});
    }*/
    vector<long long> x(n);
    for (int i = 0; i < n; i++) x[i] = skim(i + 1);
    long long sum = 0;
    vector<int> vec;
    for (int i = 0; i < k - 1; i++) sum += x[i], vec.push_back(i);
    for (int i = k; i < n; i++)
    {
        if (x[i] > a)
        {
            sum += x[i];
            vec.push_back(i);
            if (a <= sum && sum <= a * 2) answer(vec);
            break;
        }
    }
    for (int i = 0; i + k - 1 < n; i++)
    {
        sum = 0;
        vec.clear();
        for (int j = i; j <= i + k - 1; j++)
        {
            sum += x[j];
            vec.push_back(j);
        }
        if (a <= sum && sum <= a * 2) answer(vec);
    }
    impossible();
}

• 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