이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <books.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <map>
#include <set>
#include <unordered_set>
#include <cstring>
#include <queue>
#include <array>
using namespace std; using ll=int64_t;
#define rep(i,n) for(ll i=0; i<ll(n); ++i)
#define vi vector<ll>
#define all(x) begin(x), end(x)
#define pi pair<ll, ll>
// N books, buy K books, difficulty between A and 2A, skims allowed.
void solve(int N, int K, long long A, int S){
vector<int> buys;
long long left=1, right=N;
while(right-left+1 >= K && S >= 2){
long long mid = left + (right-left)/2;
if(mid + K > N){
if(left) --left;
else break;
continue;
}
double avg_diff = (double(skim(mid)) + double(skim(mid+K)))/2.0;
S-=2;
if(A <= avg_diff && avg_diff <= 2*A){
for(ll i=mid; mid<=mid+K; ++i) buys.push_back(i);
answer(buys);
}
if(avg_diff < A) left=mid;
else right=mid;
}
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... |