Submission #743981

#	Time	Username	Problem	Language	Result	Execution time	Memory
743981		myrcella	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	10 ms	336 KiB

books

//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define mod 1000000007
typedef long long ll;
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "books.h"

const int maxn = 1e5+10;
ll dif[maxn];

void solve(int N, int K, long long A, int S) {
    // TODO implement this function
    rep(i,1,N+1) dif[i] = skim(i);
	ll sum = 0;
	rep(i,1,K+1) {
		sum += dif[i];
		if (sum>2*A) impossible();
	}
	vector <int> ret;
	if (sum>=A) {
		rep(i,1,K+1) ret.pb(i);
		answer(ret);
	}
	rep(i,K+1,N+1) {
		sum += dif[i];
		sum -= dif[i-K];
		if (sum>2*A) impossible();
		if (sum>=A) {
			rep(j,i-K+1,i+1) ret.pb(j);
			answer(ret);
		}
	}
	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