Problem p00296 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define omajinai                                                               \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(0)
#define rep(i, x) for (int i = 0; i < (int)(x); ++i)
#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template <typename T> T &max(T &a, T &b) {
  if (a >= b)
    return a;
  return b;
}
template <typename T> T &min(T &a, T &b) {
  if (a < b)
    return a;
  return b;
}
template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> T get() {
  T a;
  cin >> a;
  return a;
}
template <typename T> T rev(T a) {
  reverse(all(a));
  return a;
}
template <typename T> vector<T> &sort(vector<T> &a) {
  sort(all(a));
  return a;
}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

signed main() {
  int N, M, Q;
  cin >> N >> M >> Q;

  vi nxt(N), prv(N);

  vector<bool> answer(N);

  rep(i, N) {
    nxt[i] = i + 1 >= N ? 0 : i + 1;
    prv[i] = i - 1 < 0 ? N - 1 : i - 1;
  }

  int now_pos = 0;

  rep(i, M) {
    int a;
    cin >> a;
    if (a % 2 == 0) {
      rep(_, a) { now_pos = nxt[now_pos]; }

      prv[nxt[now_pos]] = prv[now_pos];
      nxt[prv[now_pos]] = nxt[now_pos];

      answer[now_pos] = true;

      now_pos = nxt[now_pos];
    } else {
      rep(_, a) { now_pos = prv[now_pos]; }

      prv[nxt[now_pos]] = prv[now_pos];
      nxt[prv[now_pos]] = nxt[now_pos];

      answer[now_pos] = true;

      now_pos = nxt[now_pos];
    }
  }

  rep(i, Q) {
    int q;
    cin >> q;
    cout << !answer[q] << endl;
  }
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define size(a) ((int)a.size())
#define int long long
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define omajinai                                                               \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(0)
#define rep(i, x) for (int i = 0; i < (int)(x); ++i)
#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template <typename T> T &max(T &a, T &b) {
  if (a >= b)
    return a;
  return b;
}
template <typename T> T &min(T &a, T &b) {
  if (a < b)
    return a;
  return b;
}
template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> T get() {
  T a;
  cin >> a;
  return a;
}
template <typename T> T rev(T a) {
  reverse(all(a));
  return a;
}
template <typename T> vector<T> &sort(vector<T> &a) {
  sort(all(a));
  return a;
}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

bool f[200001];
int N, M, Q;

int nxt(int idx, bool is_clockwise) {
  if (is_clockwise) {
    if (idx + 1 >= N)
      return 0;
    return idx + 1;
  }

  if (idx - 1 < 0)
    return N - 1;
  return idx - 1;
}

signed main() {
  cin >> N >> M >> Q;

  int now = 0;
  rep(i, M) {
    int a;
    cin >> a;

    bool type = a % 2 == 0;
    rep(i, a) {
      now = nxt(now, type);
      if (f[now])
        i--;
    }

    f[now] = true;
    do
      now = nxt(now, 1);
    while (f[now]);
  }

  rep(i, Q) {
    int q;
    cin >> q;
    cout << !f[q] << endl;
  }
}