Submission #2374364

---

Source Code Expand

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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF 1e16
#define mod 1000000007

ll n,D,q;
ll d[500001];
ll pre[500001];
ll dp[500001];

int main(){
  cin>>n>>D;
  rep(i,n)cin>>d[i];
  dp[n]=1;
  for(ll i=n-1;i>=0;i--){
    if(dp[i+1]<=d[i]/2){
      dp[i]=dp[i+1];
    }else{
      dp[i]=dp[i+1]+d[i];
    }
  }
  rep(i,n){
    pre[i]=D;
    if(d[i]<=D){
      D-=d[i];
    }else if(d[i]<=2*D){
      D=d[i]-D;
    }
  }

  cin>>q;
  while(q--){
    ll t;
    cin>>t;
    t--;
    if(pre[t]<dp[t+1]){
      cout<<"NO"<<endl;
    }else{
      cout<<"YES"<<endl;
    }
  }

  return 0;
}

Submission Info

Judge Result