Envío 5211

Código

#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <string>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
using namespace std;

////////////// Prewritten code follows. Look down for solution. ////////////////
#define foreach(x, v) for (typeof (v).begin() x=(v).begin(); x !=(v).end(); ++x)
#define For(i, a, b) for (int i=(a); i<(b); ++i)
#define D(x) cerr << #x " is " << (x) << endl

const double EPS = 1e-9;
int cmp(double x, double y = 0, double tol = EPS) {
    return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
////////////////////////// Solution starts below. //////////////////////////////


int main(){
  int N;
  long R;
  cin >> N >> R;
  vector<int> P(N);
  vector<int> cards(N);
  for (int i = 0; i < N; ++i) {
    cin >> P[i];
    cards[i] = i+1;
  }

  while (R > 0) {
    if (R & 1) {
      vector<int> new_cards(N);
      for (int i = 0; i < N; ++i) {
        new_cards[P[i]] = cards[i];
      }
      cards.swap(new_cards);
    }
    R >>= 1;

    // P_squared[i] = P[P[i]]
    vector<int> P_squared(N);
    for (int i = 0; i < N; ++i) {
      P_squared[i] = P[P[i]];
    }
    P_squared.swap(P);
  }

  for (int i = 0; i < N; ++i) {
    if (i > 0) cout << " ";
    cout << cards[i];
  }
  cout << endl;

  return 0;
}