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 "books.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
ll arr[100002];
int s, lim;
void solve(int N, int K, ll A, int S){
n = N, k = K, s = S, lim = A;
for(int i=1; i<=n; i++) arr[i] = skim(i);
for(int i=1; i<=n-k; i++){
ll sum = 0;
for(int j=i; j<=i+k; j++) sum += arr[j];
for(int j=i; j<=i+k; j++){
if(A <= sum - arr[j] && sum - arr[j] <= A+A){
vector<int> v;
for(int a=i; a<=i+k; a++) if(a!=j) v.push_back(a);
answer(v);
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... |