이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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.
//
void solve(int n, int k, long long a, int S) {
// // TODO implement this function
// if (skim(2) == 42) {
// impossible();
// } else {
// answer({1, 3});
// }
if (skim(1) > 2 * a) impossible();
int l = 1, r = n;
while (l != r){
int mid = (l + r + 1)/2;
if (skim(mid) > 2 * a) r = mid - 1;
else l = mid;
}
int x = skim(l);
assert(x <= 2 * a);
if (x >= a) answer({l});
int sum = x;
int cnt = 1;
vector <int> ok;
ok.push_back(l);
for (int i = l - 1; i >= 1; i--){
cnt++;
if (cnt > k) break;
sum += skim(i);
ok.push_back(i);
if (sum >= a) answer(ok);
}
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... |