제출 #976870

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

books

#include<vector>
#include<cstdio>
#include<set>
#include<cstdlib>
#include<cstdarg>
#include<cassert>
#include"books.h"
#include <bits/stdc++.h>
using namespace std;
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
 
void solve(int N, int K, long long A, int S) {
    __int128 X[N + 1];
    X[0] = 0;
    for(int i = 1; i <= N; i++)X[i] = X[i - 1] + skim(i);
    for(int i = K; i <= N; i++){
		if(X[i] - X[i - K] >= A && X[i] - X[i - K] <= 2 * A){
			vector <int> v;
			for(int j = i - K + 1; j <= i; j++)v.push_back(j);
			answer(v);
		}
	}
	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