제출 #950106

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

books

#include <bits/stdc++.h>

#include "books.h"

using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
//
// --- 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.
//

/*
if (skim(2) == 42) {
	impossible();
} else {
	answer({1, 3});
}

*/

void solve(int N, int K, long long A, int S) {
    // TODO implement this function
	vector<pll> v;
	ll sum = 0;
	ll big = 0;
	ll l = 1,r = N+1;
	while(l != r){
		ll mid = (l+r)>>1;
		if(skim(mid)>=A)r = mid;
		else l = mid+1;
	}
	big = r;
	if(big<=N&&big>=K){
		ll sum = skim(big);
		vector<int> v;
		v.push_back(big);
		for(int i = 1;i<K;i++){
			v.push_back(i);
			sum += skim(i);
		}
		if(sum>=A&&sum<=A*2){
			answer(v);
			return;
		}
	}
	if(big<K){
		impossible();
		return;
	}
	for(int i = 1;i<=K;i++){
		v.push_back(pll(i,skim(i)));
		sum += v.back().sc;
	}
	for(int i = K-1;i>=0;i--){
		if(sum>=A&&sum<=A*2)break;
		ll l = i+1,r = (i+1==v.size()?big-1:v[i+1].fs-1);
		while(l != r){
			ll mid = (l+r)>>1;
			if(skim(mid)+sum-v[i].sc>=A)r = mid;
			else l = mid+1;
		}
		sum -= v[i].sc;
		v[i] = pll(l,skim(l));
		sum += v[i].sc;
	}
	if(sum<A||sum>A*2){
		impossible();
		return;
	}
	vector<int> ans;
	for(auto &i:v)ans.push_back(i.fs);
	answer(ans);
}

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

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:65:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   ll l = i+1,r = (i+1==v.size()?big-1:v[i+1].fs-1);
      |                   ~~~^~~~~~~~~~

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