Submission #10078067

---

Source Code Expand

#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define Flag(x) (1<<(x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};

int main(void){
    lint N,D;
    cin >> N >> D;
    lint d[N];
    rep(i,N) cin >> d[i];
    lint dis[N+1]={};
    dis[0]=D;
    for(int i=1;i<=N;i++) dis[i]=min(dis[i-1],llabs(dis[i-1]-d[i-1]));
    lint able[N+1]={};
    able[N]=1;
    for(int i=N-1;i>=0;i--){
        if(able[i+1]<=d[i]/2) able[i]=able[i+1];
        else able[i]=able[i+1]+d[i];
    }
    int Q;
    cin >> Q;
    rep(i,Q){
        int q;
        cin >> q;
        if(able[q]<=dis[q-1]) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
}

Submission Info

Judge Result