제출 #865417

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

books

#include <iostream>
#include <vector>
#include "books.h"

#define ll long long

using namespace std;

void solve(int n, int k, ll A, int S) {
    vector<ll> a(n);
    bool ok = false;
    ll sum = 0;
    int mid = -1;
    for(int i = 0; i < n; i++) {
        a[i] = skim(i+1);
        if(a[i] >= A && mid == -1) mid = i; 
    }
    for(int i = 0; i < k-1; i++) sum+=a[i];
    mid = min(mid, k);
    for(int i = mid; i > k-2; i--) {
        if(sum+a[i] >= A && sum+a[i] <= 2*A) {
            vector<int> b(k);
            for(int j = 0; j < k-1; j++) b[j] = j+1;
            b[k-1] = i+1;
            answer(b);
            return;
            ok = true;
        }
    }
    if(!ok) 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