Problem p03743 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop                                                                   \
  char nyaa;                                                                   \
  cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-4;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int n, Q;
ll D;
ll d[1 << 17];
ll m[1 << 17];
ll loc[1 << 17];
int main() {
  cin >> n >> D;
  rep(i, n) { cin >> d[i]; }
  m[n] = 1;
  per(i, n) {
    if (d[i] <= 2 * m[i + 1] - 1) {
      m[i] = m[i + 1] + d[i];
    } else
      m[i] = m[i + 1];
  }
  loc[0] = D;
  rep(i, n) { loc[i + 1] = min({loc[i], abs(loc[i] - d[i])}); }
  cin >> Q;
  rep(i, Q) {
    int q;
    cin >> q;
    q--;
    if (loc[q] >= m[q + 1])
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  // stop
  return 0;
}

Fixed submission:
#include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop                                                                   \
  char nyaa;                                                                   \
  cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-4;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int n, Q;
ll D;
ll d[1 << 19];
ll m[1 << 19];
ll loc[1 << 19];
int main() {
  cin >> n >> D;
  rep(i, n) { cin >> d[i]; }
  m[n] = 1;
  per(i, n) {
    if (d[i] <= 2 * m[i + 1] - 1) {
      m[i] = m[i + 1] + d[i];
    } else
      m[i] = m[i + 1];
  }
  loc[0] = D;
  rep(i, n) { loc[i + 1] = min({loc[i], abs(loc[i] - d[i])}); }
  cin >> Q;
  rep(i, Q) {
    int q;
    cin >> q;
    q--;
    if (loc[q] >= m[q + 1])
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  // stop
  return 0;
}