# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925019 | NintsiChkhaidze | A Difficult(y) Choice (BOI21_books) | C++17 | 1 ms | 608 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"
//#define ll long long
#define pb push_back
using namespace std;
long long x[100005];
void solve(int N, int K, long long A, int S) {
long long s = 0;
int k = K;
int n = N;
for (int i = 1; i <= k; i++){
x[i] = skim(i);
s += x[i];
}
if (s >= 2*A) impossible();
s = 0;
for (int i = n - k + 1; i <= n; i++){
if (!x[i]) x[i] = skim(i);
s += x[i];
}
if (s < A) impossible();
int l = k,r = n,res=-1;
while (l <= r){
int mid = (l + r) >> 1;
long long sum = 0;
for (int i = mid; i >= mid - k + 1; i--){
if (!x[i]) x[i] = skim(i);
sum += x[i];
}
if (sum >= A && sum < 2*A){
vector <int> ans;
for (int i = mid - k + 1; i <= mid; i++)
ans.pb(i);
answer(ans);
break;
}
if (sum < A) {
l = mid + 1;
}else {
r = mid - 1;
}
}
}
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... |