Submission #743986

#	Time	Username	Problem	Language	Result	Execution time	Memory
743986		myrcella	A Difficult(y) Choice (BOI21_books)	C++17	5 / 100	256 ms	360 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);
    rep(i,1,N+1)
		rep(j,i+1,N+1)
			rep(k,j+1,N+1) if (dif[i]+dif[j]+dif[k]>=A and dif[i]+dif[j]+dif[k]<=A+A) answer({i,j,k});
	impossible();
}

• Subtask 1: 5 / 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