제출 #1194392

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

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;
using ll = long long;

void solve(int n, int k, ll A, int s) {
    vector<int> a(n+1);
    vector<ll> pref(n+1);
    for(int i=1; i<=n; i++) {
        a[i] = skim(i);
        pref[i] = a[i] + pref[i-1];
    }

    for(int i=1; i+k-1<=n; i++) {
        ll sum = pref[i+k-1] - pref[i-1];
        if(A <= sum && sum <= 2*A) {
            vector<int> ans;
            for(int j=i; j<=i+k-1; j++) ans.push_back(j);
            answer(ans);
            return ;
        }
    }

    for(int i=2; i+k-2<=n; i++) {
        ll sum = pref[i+k-2] - pref[i-1];
        int l=1, r=i-1, p=0;
        while(l <= r) {
            int mid = (l + r) / 2;
            if(A <= sum + a[mid]) p = mid, r = mid - 1;
            else l = mid + 1;
        }

        if(p && sum + a[p] <= 2 * A) {
            vector<int> ans = { p };
            for(int j=i; j<=i+k-2; j++) ans.push_back(j);
            answer(ans);
            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