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;
long long b[200001];
void idk(int x, int y){
vector<int>fin;
for(int i = x; i <= y; i++) fin.push_back(i);
answer(fin);
}
void solve(int n, int k, long long a, int s) {
int j = 0;
for(int i = 0; i < n; i++) {
b[i] = skim(i);
if(i) b[i] += b[i - 1];
}
if(b[k - 1] >= a && b[k - 1] <= 2 * a){
idk(1,k);
return;
}
for(int i = k; i < n; i++, j++){
if(b[i] - b[j] >= a && b[i] - b[j] <= 2 * a){
idk(j + 1, i + 1);
return;
}
}
impossible();
}
# | 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... |