Submission #6497435

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
static const int INF (1<<30);

int main() {
  ll N;
  ll K;
  cin >> N >> K;
  vector<pair<int,int>> A(N);
  vector<int> cnt(N+1, 0);
  vector<vector<int>> id(N+1);

  rep(i, N) {
    int x; cin >> x;
    A[i].first = x;
    cnt[x]++;
    A[i].second = cnt[x];
    id[x].push_back(i);
  }

  ll T = 0LL;
  int k = 0;
  vector<int> sub;
  while (true) {
    int x = A[k].first;

    if (A[k].second == cnt[x]) {
      sub.push_back(k);
      T += (ll)(N + id[x][0] - k + 1);
      k = id[x][0] + 1;
    } else {
      T += (ll)(id[x][A[k].second] - id[x][A[k].second-1] + 1);
      k = id[x][A[k].second] + 1;
    }

    if (k == N) break;
  }
  sub.push_back(N);

  
  ll t = T / N;
  if (t == 0) return 0;
  int mod = (int)(K % t);

  //int mod = ((K * N) % T) / N;

  if (mod == 0) {
    cout << "" << endl;
  } else {

    int k = sub[mod-1];
    while (true) {
      int x = A[k].first;
      if (A[k].second == cnt[x]) {
        cout << x << " ";
        k++;
      } else {
        k = id[x][A[k].second]+1;
      }

      if (k == N) break;
    }

    cout << endl;
  }
    

  return 0;
}

Submission Info

Judge Result