Submission #2855686

---

Source Code Expand

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

#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};

int N, D, Q;
int d[550000], q[550000];
int def[550000], con[550000];
bool ans[550000];

signed main() {
    cin >> N >> D;
    for (int i = 1; i <= N; i++)cin >> d[i];
    def[1] = D;
    for (int i = 2; i <= N; i++) {
        if (d[i - 1] <= 2 * def[i - 1])def[i] = abs(d[i - 1] - def[i - 1]);
        else def[i] = def[i - 1];
    }
    con[N] = 1;
    for (int i = N - 1; i > 0; i--) {
        if (2 * con[i + 1] > d[i + 1])con[i] = con[i + 1] + d[i + 1];
        else con[i] = con[i + 1];
    }

    cin >> Q;
    for (int i = 0; i < Q; i++)cin >> q[i];
    for (int i = 0; i < Q; i++) {
        if (con[q[i]] <= def[q[i]])cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return 0;
}

Submission Info

Judge Result