Problem p02964 (C++)

Buggy submission (status: Runtime Error):
#ifdef LOCAL
// #define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18 + 18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp)                                                             \
  cerr << #mp << ":" << endl;                                                  \
  for (auto i = mp.begin(); i != mp.end(); ++i) {                              \
    cerr << i->first << ":" << i->second << endl;                              \
  }
#define dbgset(st)                                                             \
  cerr << #st << ":" << endl;                                                  \
  for (auto i = st.begin(); i != st.end(); ++i) {                              \
    cerr << *i << " ";                                                         \
  }                                                                            \
  cerr << endl;
#define dbgarr(n, m, arr)                                                      \
  rep(i, n) {                                                                  \
    rep(j, m) { cerr << arr[i][j] << " "; }                                    \
    cerr << endl;                                                              \
  }
#define dbgdp(n, arr)                                                          \
  rep(i, n) { cerr << arr[i] << " "; }                                         \
  cerr << endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define vout(v)                                                                \
  rep(i, v.size()) { cout << v[i] << " "; }                                    \
  cout << endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
  return s << "(" << p.first << ", " << p.second << ")";
}

template <typename T> istream &operator>>(istream &i, vector<T> &v) {
  rep(j, v.size()) i >> v[j];
  return i;
}

// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
  int len = v.size();
  for (int i = 0; i < len; ++i) {
    s << v[i];
    if (i < len - 1)
      s << "	";
  }
  return s;
}

// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
  int len = vv.size();
  for (int i = 0; i < len; ++i) {
    s << vv[i] << endl;
  }
  return s;
}

// mint
struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += MOD - a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime MOD
  mint inv() const { return pow(MOD - 2); }
  mint &operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
typedef vector<mint> Vmint;
typedef vector<vector<mint>> VVmint;
typedef vector<vector<vector<mint>>> VVVmint;

struct combination {
  vector<mint> fact, ifact;
  combination(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < MOD);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i)
      fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i)
      ifact[i - 1] = ifact[i] * i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n)
      return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
};

int solve() {
  ll n, k;
  cin >> n >> k;
  Vec a(n);
  cin >> a;

  ll mx = 200005;
  mx = 10;
  VV g(mx);
  rep(i, n) { g[a[i]].pb(i); }
  rep(i, n) { g[a[i]].pb(i + n); }

  Vec pos(2 * n + 1, -1);
  auto dfs = [&](auto dfs, ll x) -> ll {
    if (pos[x] != -1)
      return pos[x];
    if (x == 2 * n)
      return pos[x] = n;
    auto itr = upper_bound(ALL(g[a[x % n]]), x);
    if (itr == g[a[x % n]].end()) {
      return pos[x] = x % n;
    } else {
      return pos[x] = dfs(dfs, *itr + 1);
    }
  };
  rep(i, 2 * n + 1) { dfs(dfs, i); }
  VV dp(45, Vec(n + 1));
  rep(i, n + 1) { dp[0][i] = pos[i]; }
  REP(j, 1, 45) {
    rep(i, n + 1) { dp[j][i] = dp[j - 1][dp[j - 1][i]]; }
  }
  k--;
  ll now = 0;
  dbg(dp);
  rep(bit, 45) {
    if (k & (1LL << bit)) {
      now = dp[bit][now];
    }
  }
  set<ll> st;
  Vec v;
  REP(i, now, n) {
    ll x = a[i];
    if (st.count(x) > 0) {
      while (v.back() != x) {
        st.erase(v.back());
        v.pop_back();
      }
      st.erase(x);
      v.pop_back();
    } else {
      st.insert(x);
      v.pb(x);
    }
  }
  vout(v);
  return 0;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << std::setprecision(10);
  //    ll T;
  //    cin>>T;
  //    while(T--)
  solve();
}


Fixed submission:
#ifdef LOCAL
// #define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18 + 18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp)                                                             \
  cerr << #mp << ":" << endl;                                                  \
  for (auto i = mp.begin(); i != mp.end(); ++i) {                              \
    cerr << i->first << ":" << i->second << endl;                              \
  }
#define dbgset(st)                                                             \
  cerr << #st << ":" << endl;                                                  \
  for (auto i = st.begin(); i != st.end(); ++i) {                              \
    cerr << *i << " ";                                                         \
  }                                                                            \
  cerr << endl;
#define dbgarr(n, m, arr)                                                      \
  rep(i, n) {                                                                  \
    rep(j, m) { cerr << arr[i][j] << " "; }                                    \
    cerr << endl;                                                              \
  }
#define dbgdp(n, arr)                                                          \
  rep(i, n) { cerr << arr[i] << " "; }                                         \
  cerr << endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define vout(v)                                                                \
  rep(i, v.size()) { cout << v[i] << " "; }                                    \
  cout << endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
  return s << "(" << p.first << ", " << p.second << ")";
}

template <typename T> istream &operator>>(istream &i, vector<T> &v) {
  rep(j, v.size()) i >> v[j];
  return i;
}

// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
  int len = v.size();
  for (int i = 0; i < len; ++i) {
    s << v[i];
    if (i < len - 1)
      s << "	";
  }
  return s;
}

// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
  int len = vv.size();
  for (int i = 0; i < len; ++i) {
    s << vv[i] << endl;
  }
  return s;
}

// mint
struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += MOD - a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime MOD
  mint inv() const { return pow(MOD - 2); }
  mint &operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
typedef vector<mint> Vmint;
typedef vector<vector<mint>> VVmint;
typedef vector<vector<vector<mint>>> VVVmint;

struct combination {
  vector<mint> fact, ifact;
  combination(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < MOD);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i)
      fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i)
      ifact[i - 1] = ifact[i] * i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n)
      return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
};

int solve() {
  ll n, k;
  cin >> n >> k;
  Vec a(n);
  cin >> a;

  ll mx = 200005;
  // mx = 10;
  VV g(mx);
  rep(i, n) { g[a[i]].pb(i); }
  rep(i, n) { g[a[i]].pb(i + n); }

  Vec pos(2 * n + 1, -1);
  auto dfs = [&](auto dfs, ll x) -> ll {
    if (pos[x] != -1)
      return pos[x];
    if (x == 2 * n)
      return pos[x] = n;
    auto itr = upper_bound(ALL(g[a[x % n]]), x);
    if (itr == g[a[x % n]].end()) {
      return pos[x] = x % n;
    } else {
      return pos[x] = dfs(dfs, *itr + 1);
    }
  };
  rep(i, 2 * n + 1) { dfs(dfs, i); }
  VV dp(45, Vec(n + 1));
  rep(i, n + 1) { dp[0][i] = pos[i]; }
  REP(j, 1, 45) {
    rep(i, n + 1) { dp[j][i] = dp[j - 1][dp[j - 1][i]]; }
  }
  k--;
  ll now = 0;
  dbg(dp);
  rep(bit, 45) {
    if (k & (1LL << bit)) {
      now = dp[bit][now];
    }
  }
  set<ll> st;
  Vec v;
  REP(i, now, n) {
    ll x = a[i];
    if (st.count(x) > 0) {
      while (v.back() != x) {
        st.erase(v.back());
        v.pop_back();
      }
      st.erase(x);
      v.pop_back();
    } else {
      st.insert(x);
      v.pb(x);
    }
  }
  vout(v);
  return 0;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << std::setprecision(10);
  //    ll T;
  //    cin>>T;
  //    while(T--)
  solve();
}