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

#include <cstdio>

using namespace std;

int n, m, q;
struct student {
  bool canBeExempted;
  int next;
  int before;
};
student students[200000];

int main() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 0; i < n; i++) {
    students[i].canBeExempted = true;
    students[i].next = (i + 1) % n;
    students[i].before = (i + n - 1) % n;
  }
  int haveBaton = 0;
  for (int i = 0; i < m; i++) {
    int a;
    scanf("%d", &a);
    if (a % 2) {
      while (a--) {
        haveBaton = students[haveBaton].before;
      }
    } else {
      while (a--) {
        haveBaton = students[haveBaton].next;
      }
    }
    students[haveBaton].canBeExempted = false;
    students[students[haveBaton].before].next = students[haveBaton].next;
    students[students[haveBaton].next].before = students[haveBaton].before;
    haveBaton = students[haveBaton].next;
  }
  for (int i = 0; i < q; i++) {
    int num;
    scanf("%d", &num);
    printf("%d\\n", students[num].canBeExempted ? 1 : 0);
  }
  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for (int i = s; i < (int)n; i++)
#define per(i, n) for (int i = n; i >= 0; i--)
#define ROF(i, s, n) for (int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\\n"
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n)                                                             \\
  for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define CLR(a) memset((a), 0, sizeof(a))
#define NCLR(a) memset((a), -1, sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\\n";
#define debug(x)                                                               \\
  cout << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << "\\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue<int, vector<int>, greater<int>> minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos(-1.0);
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = {-1, 0, 1, 0, 1, -1, 1, -1};
static const int dy[] = {0, -1, 0, 1, 1, 1, -1, -1};

int main() {
  int n, m, q;
  scanf("%d %d %d", &n, &m, &q);
  static VI a;
  for (int i = 0; i < n; i++) {
    a.push_back(i);
  }
  int now = 0;
  for (int i = 0; i < m; i++) {
    int b;
    scanf("%d", &b);
    if (b % 2) {
      b %= a.size();
      now = (now + a.size() - b) % a.size();
      a.erase(a.begin() + now);
      now %= a.size();
    } else {
      b %= a.size();
      now = (now + b) % a.size();
      a.erase(a.begin() + now);
      now %= a.size();
    }
  }
  set<int> s(a.begin(), a.end());
  for (int i = 0; i < q; i++) {
    int b;
    scanf("%d", &b);
    printf("%d\\n", s.count(b));
  }
  return 0;
}