Submission #4032599

---

Source Code Expand

#include <iostream>
#include <algorithm>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n-1); i >= 0; --i)

const int MAX = 5e5+10;
int N, D, Q;
int d[MAX];
int pos[MAX];
int rev[MAX];
bool ans[MAX];

inline int move(int p, int d) {
    return min(p, abs(p-d));
}

inline int moveRev(int p, int d) {
    if (d/2 >= p) return p;
    return p+d;
}

int main() {
    cin >> N >> D;
    pos[0] = D;
    REP (i, N) {
        cin >> d[i];
        pos[i+1] = move(pos[i], d[i]);
    }

    rev[N] = 1;
    REPR (i, N) {
        rev[i] = moveRev(rev[i+1], d[i]);
    }

    REP (i, N) {
        ans[i] = pos[i] >= rev[i+1];
    }

    cin >> Q;
    REP (q, Q) {
        int i;
        cin >> i;
        cout << ((ans[i-1])?"YES":"NO") << endl;
    }
}

Submission Info

Judge Result