이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define ii pair<int,int>
#define vi vector<int>
typedef vector<ii> vii;
//
// --- 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
vector<long long> V(N+5);
vector<int> ans;
long long sum=0;
for (int i=1; i<=K; i++){
V[i]=skim(i);
sum+=V[i];
ans.push_back(V[i]);
}
if (sum>2*A){
impossible();
}else if (sum>=A){
//answer!!
answer(ans);
}else{
//sum<A
ans.clear();
//binary search from K+1 to N
int L=K+1, R=N, M;
while (L < R){
M = (L+R)/2;
if (V[M]!=0) V[M] = skim(M);
if (V[M] > A){
R = M;
}else{
L = M+1;
}
}
if (L <= K) impossible();
if (L <= N){
if (sum-V[K]+V[L] <= 2*A) {
ans[K-1]=L;
answer(ans);
}
}
}
}
# | 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... |