Submission #1172540

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172540		perchuts	A Difficult(y) Choice (BOI21_books)	C++20	25 / 100	28 ms	1176 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 solvar(int n, int k, long long a, int s) {
#define int long long
    vector<int> v(n);
    for (int i = 0; i < k; ++i) v[i] = skim(i+1);
    int cur = 0; 
    set<int> ans;
    for (int i = 0; i < k-1; ++i) ans.insert(i+1), cur += v[i];
    int l = k-1, r = n-1, lim = n-1;
    while (l <= r) {
        int md = l + (r-l+1)/2;
        if (v[md] == 0) v[md] = skim(md+1);
        if (cur + v[md] >= a) lim = md, r = md-1;
        else l = md+1;
    }
    auto go = [&] () {
        vector<int32_t> resp;
        for (auto x : ans) resp.push_back(x);
        answer(resp);
    };
    cur += v[k-1], ans.insert(k);
    if (a <= cur and cur <= 2*a) go();
    for (int i = k; i < n; ++i) {
        int x = cur - v[k-1] + v[i];
        if (a <= x and x <= 2*a) {
            ans.erase(k);
            ans.insert(i+1);
            go();
        }
    }
    if (lim < k) impossible();
    for (int i = lim-1; i > lim-k; --i) if (v[i] == 0) v[i] = skim(i+1);
    for (int i = k-1; ~i; --i) {
        for (int j = i+1; j <= lim-(k-1-i); ++j) {
            cur += v[j] - v[j-1];
            ans.insert(j+1);
            ans.erase(j);
            if (a <= cur) go();
        }
    }
    impossible();
#define int int
}

void solve(int n, int k, long long a, int s) {
    s = min(s, n);
    if (s == n or s >= 170) solvar(n, k, a, s);    
    assert(false);
}

Compilation message (stderr)

books.cpp:55: warning: "int" redefined
   55 | #define int int
      | 
books.cpp:16: note: this is the location of the previous definition
   16 | #define int long long
      |

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 10 / 10
• Subtask 4: 15 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20