Problem p02964 (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-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n, pos;
ll k, T = 1;
vector<vector<int>> table;
vector<int> as, used, route = {};
vector<P> to;

void solve() {
  cin >> n >> k;
  table.resize(1000000, {});
  used.resize(n + 1, 0);
  to.resize(n + 1, P(0, 0));
  rep(i, n) {
    int a;
    cin >> a;

    as.push_back(a - 1);
    table[a - 1].push_back(i);
  }
  rep(i, n) {
    // cout << as[i] << " " << used[as[i]] << endl;
    to[i].first = table[as[i]][(used[as[i]] + 1) % table[as[i]].size()] + 1;
    if (used[as[i]] + 1 >= table[as[i]].size()) {
      to[i].second = 1;
    }
    used[as[i]] += 1;
  }
  pos = 0;
  while (pos != n) {
    route.push_back(pos);
    T += to[pos].second;
    pos = to[pos].first;
  }
  route.push_back(n);

  // cout << " " << endl;
  // rep(i,n) cout << to[i].first << " " << to[i].second << endl;
  // rep(i,route.size()) cout << route[i] << " ";
  // cout << " " << endl;
  // cout << T << endl;
  int a = 0, pos = 0;

  while (a < (k - 1) % T) {
    P p = to[pos];
    pos = p.first;
    a += p.second;
    // cout << pos << " " << a << endl;
  }

  Rep(i, pos, n) {
    if (to[i].second)
      cout << as[i] + 1 << " ";
    else
      i = to[i].first - 1;
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
}

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-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n, pos;
ll k, T = 1;
vector<vector<int>> table;
vector<int> as, used, route = {};
vector<P> to;

void solve() {
  cin >> n >> k;
  table.resize(1000000, {});
  used.resize(1000000, 0);
  to.resize(n + 1, P(0, 0));
  rep(i, n) {
    int a;
    cin >> a;

    as.push_back(a - 1);
    table[a - 1].push_back(i);
  }
  rep(i, n) {
    // cout << as[i] << " " << used[as[i]] << endl;
    to[i].first = table[as[i]][(used[as[i]] + 1) % table[as[i]].size()] + 1;
    if (used[as[i]] + 1 >= table[as[i]].size()) {
      to[i].second = 1;
    }
    used[as[i]] += 1;
  }
  pos = 0;
  while (pos != n) {
    route.push_back(pos);
    T += to[pos].second;
    pos = to[pos].first;
  }
  route.push_back(n);

  // cout << " " << endl;
  // rep(i,n) cout << to[i].first << " " << to[i].second << endl;
  // rep(i,route.size()) cout << route[i] << " ";
  // cout << " " << endl;
  // cout << T << endl;
  int a = 0, pos = 0;

  while (a < (k - 1) % T) {
    P p = to[pos];
    pos = p.first;
    a += p.second;
    // cout << pos << " " << a << endl;
  }

  Rep(i, pos, n) {
    if (to[i].second)
      cout << as[i] + 1 << " ";
    else
      i = to[i].first - 1;
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
}