# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657392 | Lobo | A Difficult(y) Choice (BOI21_books) | C++17 | 211 ms | 644 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
//
// --- 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.
//
const int maxn = 1e5+10;
int n, b[maxn];
int qry(int32_t i) {
if(b[i] == 0) return b[i] = skim(i);
return b[i];
}
void solve(int32_t N, int32_t k, long long A, int32_t S) {
n = N;
// TODO implement this function
for(int i = 1; i <= n; i++) {
// r-l+1 = k -> l = r-k+1
int r = i;
int l = r-k+1;
if(l < 1) continue;
int sum = 0;
for(int j = l; j <= r; j++) {
sum+= qry(j);
if(sum > 2*A) {
break;
}
}
if(sum >= A && sum <= 2*A) {
vector<int32_t> ans;
for(int j = l; j <= r; j++) {
ans.pb(j);
}
answer(ans);
return;
}
}
for(int i = k; i <= n; i++) {
// (1,k-1) and i
int sum = 0;
for(int j = 1; j <= k-1; j++) {
sum+= qry(j);
if(sum > 2*A) {
break;
}
}
if(sum+qry(i) >= A && sum+qry(i) <= 2*A) {
vector<int32_t> ans;
for(int j = 1; j <= k-1; j++) {
ans.pb(j);
}
ans.pb(i);
answer(ans);
return;
}
}
int l = k;
int r = n;
impossible();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |