제출 #414979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
414979		amunduzbaev	A Difficult(y) Choice (BOI21_books)	C++14	20 / 100	320 ms	848 KiB

books

#include "books.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif

using namespace std;

#define int long long
#define i32 int32_t
#define pb push_back
#define ff first
#define ss second

template<class T> bool umin(T& a, const T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool umax(T& a, const T b) { if(a < b) { a = b; return 1; } return 0; }
template<int sz> using tut = array<int, sz>;

const int M = 2e5+5;
const long long inf = 1e18;
const int mod = 1e9+7;
int a[M], pref[M];

void solve(i32 n, i32 k, int A, i32 s) {
	for(int i=1;i<=n;i++) a[i] = skim(i), pref[i] = pref[i-1] + a[i];
	for(int i=k;i<=n;i++) if(pref[i] - pref[i-k] >= A && pref[i] - pref[i-k] <= 2*A) {
		vector<i32> tt;
		for(int l = i-k+1; l <= i; l++) tt.pb(l);
		answer(tt); return;
	}
	
	int sum = pref[k-1];
	for(int i=k;i<=n;i++){
		if(sum + a[i] >= A && sum + a[i] <= 2 * A){
			vector<i32> tt;
			for(int j=1;j<k;j++) tt.pb(j);
			tt.pb(i); answer(tt); return; 
		}
	} impossible();
	return;
}

/*

4 3 20 5
5 10 17 25

*/

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20