제출 #813734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
813734		vjudge1	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	8 ms	320 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)
const int maxn=1e5+9;
long long a[maxn];
void solve(int n,int k,long long A,int s){
for1(i,1,n){
a[i]=skim(i);
a[i]+=a[i-1];
}
for1(i,1,n-k+1){
if (a[i+k-1]-a[i-1]>=A&&2*A>=a[i+k-1]-a[i-1]){
    vector<int>id;
    for1(j,i,i+k-1){
    id.pb(j);
    }
    answer(id);
    return;
}
}
impossible();
}
/*signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(".INP","r",stdin);
    //freopen(".OUT","w",stdout);
}*/
 

• 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