제출 #693357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
693357		BobCompetitiveProgramming	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	401 ms	524288 KiB

books

#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)*K;
        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();
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20