제출 #506285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
506285		Elegia	A Difficult(y) Choice (BOI21_books)	C++17	25 / 100	1 ms	288 KiB

books

#include <cmath>

#include <algorithm>
#include <bitset>
#include <numeric>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>

#include "books.h"

using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

long long arr[25];

void solve(int N, int K, long long A, int S) {
	int low = 1, high = N + 1;
	long long C = (A + K - 1) / K;
	while (low < high) {
		int mid = (low + high) / 2;
		if ((arr[K] = skim(mid)) >= C) high = mid;
		else low = mid + 1;
	}
	if (low > N) return impossible();
	for (int i = 1; i < K; ++i)
		arr[K - i] = i < low ? skim(low - i) : (A * 2 + 1);
	for (int i = 1; i < K; ++i)
		arr[K + i] = i + low <= N ? skim(i + low) : (A * 2 + 1);
	for (int i = 1; i <= K; ++i) {
		long long sum = accumulate(arr + i, arr + i + K, 0LL);
		if (sum >= A && sum <= A * 2) {
			vector<int> ans(K);
			iota(ans.begin(), ans.end(), low - K + i);
			return answer(ans);
		}
	}
	long long sum = 0, temp;
	for (int i = 1; i != K; ++i) sum += skim(i);
	low = K; high = N + 1;
	while (low < high) {
		int mid = (low + high) / 2;
		if ((temp = skim(mid)) >= A - sum) high = mid;
		else low = mid + 1;
	}
	if (low <= N && temp + sum <= A * 2) {
		vector<int> ans(K);
		iota(ans.begin(), ans.end(), 1);
		ans[K - 1] = low;
		return answer(ans);
	}
	return impossible();
}

컴파일 시 표준 에러 (stderr) 메시지

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:58:15: warning: 'temp' may be used uninitialized in this function [-Wmaybe-uninitialized]
   58 |  if (low <= N && temp + sum <= A * 2) {
      |      ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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