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;
//
// --- 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.
//
typedef long long ll;
void solve(int n, int k, ll a, int skims) {
// TODO implement this function
vector<ll> v(n+1);
for (int i=1;i<=n;i++){
v[i]=skim(i);
}
for (int big_id=k;big_id<=n;big_id++){
for (int c=1;c<=k;c++){
ll sum=0;
for(int i=big_id-c+1;i<=big_id;i++){
sum+=v[i];
}
for(int i=1;i<=k-c;i++){
sum+=v[i];
}
if(a<=sum&&sum<=2*a){
vector<int> sol;
for (int i=big_id-c+1;i<=big_id;i++){
sol.push_back(i);
}
for(int i=1;i<=k-c;i++){
sol.push_back(i);
}
assert((int)sol.size()==k);
answer(sol);
return;
}
}
}
impossible();
return;
}
# | 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... |