이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
void solve(int N, int K, long long A, int S) {
// TODO implement this function
//k books, sum of A
typedef long long ll;
//x, x+1, x+2, x+3, x+4, x+5... and so on
int extrasum = 0;
for (int x = 0; x < K; x++){
extrasum += x;
}
//we want A <= x*K + extrasum <= 2*A
//x*K + extrasum >= A
//x*K >= A-extrasum
//x >= (A-extrasum)/K
ll target = (A - extrasum)/K + ((A - extrasum)%K != 0);
//to do: check rounding
if (A - extrasum <= 0) {impossible(); return;}
int l = 1, r = N+1-K, ans = N+1-K;
while (l <= r){
int m = (l+r)/2;
ll res = skim(m);
if (res >= target){
r = m-1;
ans = m;
}
else{
l = m+1;
}
}
ll sum = 0; vector<int> indices;
for (int x = ans; x < ans + K; x++){
sum += skim(x); indices.push_back(x);
}
if (ans != N+1-K) assert(sum >= A);
if (sum <= 2LL*A){
answer(indices);
}
else{
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... |