Submission #574779

#	Time	Username	Problem	Language	Result	Execution time	Memory
574779		RealSnake	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	10 ms	976 KiB

books

#include "bits/stdc++.h"
using namespace std;
#include "books.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define ll long long
#define mod 1000000007

void solve(int n, int k, ll A, int s) {
    // s = n;
    ll pre[n + 1];
    pre[0] = 0;
    for(int i = 1; i <= n; i++) {
        pre[i] = skim(i);
        pre[i] += pre[i - 1];
    }
    vector<int> ans;
    for(int i = 1; i + k - 1 <= n; i++) {
        ll sum = pre[i + k - 1] - pre[i - 1];
        if(sum >= A && sum <= 2 * A) {
            for(int j = i; j <= i + k - 1; j++)
                ans.push_back(j);
            answer(ans);
            return;
        }
    }
    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