제출 #976892

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
976892		penguin133	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	1 ms	344 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) {
    int lo = K, hi = N, tmp = K - 1, val = -1;
    while(lo <= hi){
		int mid = (lo + hi) >> 1;
		int tot = 0;
		for(int j = mid - K + 1; j <= mid; j++)tot += skim(j);
		if(tot >= A)tmp = mid, hi = mid - 1, val = tot;
		else lo = mid + 1;
	}
	if(val == -1 || val > 2 * A)impossible();
	else {
		vector <int> v;
		for(int j = tmp - K + 1; j <= tmp; j++)v.push_back(j);
		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