제출 #708799

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

books

#include <bits/stdc++.h>

#include "books.h"

typedef long long ll;

using namespace std;

void solve(int n, int k, ll c, int s){


    vector<ll> a;
    a.push_back(0);

    for(int i = 0; i < n; i++){
        a.push_back(skim(i+1));
    }

    vector<ll> pref;
    pref.push_back(0);

    for(int i = 1; i <= n; i++){
        pref[i]=pref[i-1]+a[i];
    }

    for(int i = 0; i <= n-k; i++){
        if(pref[i+k]-pref[i]>=c&&pref[i+k]-pref[i]<=2*c){
            vector<int> aa;
            for(int x = i+1; x <= i+k; x++){
                aa.push_back(x);
            }
            answer(aa);
            return;
        }
    }

    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