제출 #729115

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

books

#include <bits/stdc++.h>
#include "books.h"

using namespace std ;

const int N = 1e5+5 ;
int a[N] ;

void solve(int n, int k, long long l, int s) {
    int sum = 0 ;
    for ( int i = 1 ; i <= k ; i++ ) {
        a[i] = skim(i) ;
        sum += a[i] ;
    }
    if ( sum > 2*l ) {
        impossible () ;
    }
    int id = k ;
    while ( sum < l && id < n ) {
        id++ ;
        a[id] = skim(id) ;
        sum += a[id] ;
        sum -= a[id-k] ;
        if ( sum > 2*l ) {
            impossible () ;
        }
    }
    if ( sum < l ) {
        impossible () ;
    }
    vector <int> v ;
    for ( int i = id-k+1 ; i <= id ; i++ ) {
        v.push_back(i) ;
    }
    answer(v) ;
}

• 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