이 제출은 이전 버전의 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) {
int l = 1 , r = N+1 , sayac = 0;
while(l < r){
int mid = (l + r) >> 1;
sayac++;
if(skim(mid) <= A * 2){
l = mid + 1;
}
else{
r = mid;
}
}
long long sum = 0;
vector < int > v;
for(int i = 1;i <= S - sayac;i++){
if((l - i) <= 0)break;
long long res = skim(l - i);
v.push_back(l - i);
sum += res;
if(sum >= A and sum <= A * 2){
answer(v);
}
if((int)v.size() == K)break;
}
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... |