제출 #813716

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

books

#include<bits/stdc++.h>
#include "books.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
/*
typedef long long ll;

void __attribute__((noreturn)) __attribute__((format(printf, 1, 2))) result(const char *msg, ...)
{
    va_list args;
    va_start(args, msg);
    vfprintf(stderr, msg, args);
    fprintf(stderr, "\n");
    va_end(args);
    exit(0);
}

namespace
{
    int N, K, S, sUsed;
    long long A;
    vector<long long> seq;
}

void impossible()
{
    result("Impossible (not checked): %d book(s) skimmed", sUsed);
    exit(0);
}

long long skim(int pos)
{
    printf("skim(%d): ", pos);
	if (pos<1 || pos>N) result("Invalid skim");
    printf("%lld\n", seq[pos]);
	sUsed++;
	if (sUsed>S) result("Out of books to skim");
    return seq[pos];
}

void answer(vector<int> v)
{
    printf("answer({");
    for(int i = 0; i < (int) v.size(); ++i)
    {
        printf("%d", v[i]);
        if(i + 1 != (int) v.size()) printf(", ");
    }
    printf("})\n");

	if ((int) v.size() != K) result("Invalid answer");
   	ll sum = 0;
	for(auto x: v) {
		if (x<1 || x>N) result("Invalid answer");
		sum += seq[x];
	}
	if (sum < A || 2*A<sum) result("Wrong answer");

	result("Correct: %d book(s) skimmed", sUsed);
    exit(0);
}
*/

void solve(int n,int k,long long A,int s){
long long vcl=(A+k-1)/k;
long long vl=-1;
int l=1,r=n,ans=-1;
while (l<=r){
    int mid=(l+r)/2;
    long long d=skim(mid);
    if (d>=vcl){
        ans=mid;
        vl=d;
        r=mid-1;
    }
    else l=mid+1;
}
if (ans==-1){
    impossible();
    return ;
}
vector<pli>a;
a.pb({vl,ans});
for1(i,ans+1,min(n,ans+k-1)){
a.pb({skim(i),i});
}
for1(i,ans-1,max(1,ans-k+1)){
a.pb({skim(i),i});
}
int m=sz(a);
for1(i,0,(1<<m)-1){
if (__builtin_popcount(i)!=k)continue;
long long s=0;
for1(j,0,m-1){
if (i>>j&1){
    s+=a[j].fi;
}
}
if (s>=A&&s<=2*A){
    vector<int>id;
    for1(j,0,m-1){
    if (i>>j&1)id.pb(a[j].se);
    }
    answer(id);
    return;
}
}
impossible();
}
/*signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(".INP","r",stdin);
    //freopen(".OUT","w",stdout);
    if(scanf("%d %d %lld %d", &N, &K, &A, &S) != 4)
        result("Invalid input");

    seq.resize(N + 1);
    for(int i = 1; i <= N; ++i) {
    	if(scanf("%lld", &(seq[i])) != 1) result("Invalid input");
		if(i>1 && seq[i]<=seq[i-1]) result("Invalid input");
   	}

    solve(N, K, A, S);

    result("No answer");
}*/

• 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