Problem p03996 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define gep(i, g, j) for (int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it, c)                                                            \
  for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define df(x) int x = in()
#define dame                                                                   \
  {                                                                            \
    puts("0");                                                                 \
    return 0;                                                                  \
  }
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
inline void priv(vi a) {
  rep(i, sz(a)) printf("%d%c", a[i], i == sz(a) - 1 ? '\n' : ' ');
}
template <typename T> istream &operator>>(istream &i, vector<T> &v) {
  rep(j, sz(v)) i >> v[j];
  return i;
}
template <typename T> string join(vector<T> &v) {
  stringstream s;
  rep(i, sz(v)) s << ' ' << v[i];
  return s.str().substr(1);
}
template <typename T> ostream &operator<<(ostream &o, vector<T> &v) {
  if (sz(v))
    o << join(v);
  return o;
}
template <typename T1, typename T2>
istream &operator>>(istream &i, pair<T1, T2> &v) {
  return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, pair<T1, T2> &v) {
  return o << v.fi << "," << v.se;
}
const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int q;
  scanf("%d", &q);
  vi a(q);
  rep(i, q) {
    scanf("%d", &a[i]);
    --a[i];
  }
  reverse(rng(a));
  vvi p(m);
  rep(i, q) { p[a[i]].pb(i); }
  vi used(m);
  vi r(n);
  int fr = 0;
  bool ok = true;
  rep(i, q) {
    if (used[a[i]])
      continue;
    int k = 0;
    rep(j, sz(p[a[i]])) {
      assert(j >= i);
      if (r[k] > p[a[i]][j])
        continue;
      r[k] = p[a[i]][j];
      ++k;
      if (k >= n)
        break;
    }
    if (ok && k == n) {
    } else {
      if (fr == a[i]) {
        ok = false;
      } else {
        puts("No");
        return 0;
      }
    }
    used[a[i]] = 1;
    while (fr < m && used[fr])
      ++fr;
  }
  puts("Yes");
  return 0;
}


Fixed submission:
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define gep(i, g, j) for (int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it, c)                                                            \
  for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define df(x) int x = in()
#define dame                                                                   \
  {                                                                            \
    puts("0");                                                                 \
    return 0;                                                                  \
  }
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
inline void priv(vi a) {
  rep(i, sz(a)) printf("%d%c", a[i], i == sz(a) - 1 ? '\n' : ' ');
}
template <typename T> istream &operator>>(istream &i, vector<T> &v) {
  rep(j, sz(v)) i >> v[j];
  return i;
}
template <typename T> string join(vector<T> &v) {
  stringstream s;
  rep(i, sz(v)) s << ' ' << v[i];
  return s.str().substr(1);
}
template <typename T> ostream &operator<<(ostream &o, vector<T> &v) {
  if (sz(v))
    o << join(v);
  return o;
}
template <typename T1, typename T2>
istream &operator>>(istream &i, pair<T1, T2> &v) {
  return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, pair<T1, T2> &v) {
  return o << v.fi << "," << v.se;
}
const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int q;
  scanf("%d", &q);
  vi a(q);
  rep(i, q) {
    scanf("%d", &a[i]);
    --a[i];
  }
  reverse(rng(a));
  vvi p(m);
  rep(i, q) { p[a[i]].pb(i); }
  vi used(m);
  vi r(n);
  int fr = 0;
  bool ok = true;
  rep(i, q) {
    if (used[a[i]])
      continue;
    int k = 0;
    rep(j, sz(p[a[i]])) {
      if (r[k] > p[a[i]][j])
        continue;
      r[k] = p[a[i]][j];
      ++k;
      if (k >= n)
        break;
    }
    if (ok && k == n) {
    } else {
      if (fr == a[i]) {
        ok = false;
      } else {
        puts("No");
        return 0;
      }
    }
    used[a[i]] = 1;
    while (fr < m && used[fr])
      ++fr;
  }
  puts("Yes");
  return 0;
}