제출 #1154550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1154550		i271828	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	1 ms	424 KiB

books

#include <bits/stdc++.h>

#include "books.h"
#define ll long long
#define pii pair<int,int>
using namespace std;
//     g++ books_sample.cpp sample_grader.cpp
const int MAX=100005;

int A[MAX];
vector<int> books;
int cur=0;

void solve(int N, int K, long long T, int S) {
	for (int i=0;i<N;i++){
		A[i]=skim(i+1);
	}
	int l;
	while (K*A[l]<T) l++;
	for (int i=l;i<l+K;i++) books.push_back(i), cur+=A[i];
	int book_i=0;
	
	while (cur>2*T){
		if (books[book_i]==0){
			book_i++;
		}
		if (book_i==K){
			break;
		}
		cur-=A[books[book_i]];
		books[book_i]--;
		cur+=A[books[book_i]];
	}
	
	if (cur<=2*T){
		for (int i=0;i<books.size();i++){
			books[i]++;
		}
		answer(books);
	}else{
		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