제출 #635619

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
635619		PanTkd	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	3 ms	592 KiB

books

#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>
#include "books.h"

using namespace std;

typedef int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#ifdef px
    #define p(x) cerr<<#x<<' '<<x<<endl;
#else
    #define p(x) {}
#endif
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);


//
// --- 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
    vi X(N+1,ll());
    vi ans;
    queue<ll> q;
    ll sum=0;

    for(ll i=1;i<=N;i++){
        X[i]=skim(i);    
    }
    for(ll i=1;i<=K;i++){
        sum+=X[i];
        q.push(X[i]);
    }
    
    ll last=K+1;
    while(last<=N){
        bool ok=(sum>=A&&sum<=2*A);
        if(ok){
            while(!q.empty()){
                ans.push_back(q.front());
                q.pop();
            }
            answer(ans);
        }
        sum-=q.front();
        sum+=X[last];
        q.pop();
        q.push(X[last]);
        last++;
    }
    bool ok=(sum>=A&&sum<=2*A);
    if(ok){
        while(!q.empty()){
            ans.push_back(q.front());
            q.pop();
        }
        answer(ans);
    }

    ans.clear();
    sum=0;
    for(ll i=1;i<K;i++){sum+=X[i];ans.push_back(X[i]);}
    for(ll i=K;i<=N;i++){
        if(X[i]>A){
            sum+=X[i];
            ans.push_back(X[i]);
            break;
        }
    }
    if(sum>=A&&sum<=2*A)answer(ans);
    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