Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.004 s | 0 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.001 s | 0 KBi |
#5 |
Correcto
|
0.002 s | 0 KBi |
#6 |
Correcto
|
0.158 s | 57 KBi |
#7 |
Correcto
|
0.162 s | 57 KBi |
#8 |
Correcto
|
0.001 s | 0 KBi |
#9 |
Correcto
|
0.002 s | 0 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.002 s | 0 KBi |
#12 |
Correcto
|
0.01 s | 6 KBi |
#13 |
Correcto
|
0.04 s | 6 KBi |
#14 |
Correcto
|
0.049 s | 6 KBi |
#15 |
Correcto
|
0.016 s | 6 KBi |
#16 |
Correcto
|
0.06 s | 6 KBi |
#17 |
Correcto
|
0.004 s | 2 KBi |
#18 |
Correcto
|
0.001 s | 0 KBi |
#19 |
Correcto
|
0.002 s | 0 KBi |
#20 |
Correcto
|
0.001 s | 0 KBi |
#21 |
Tiempo límite excedido
|
1.059 s | 56 KBi |
#22 |
Correcto
|
0.818 s | 57 KBi |
#23 |
Tiempo límite excedido
|
1.075 s | 56 KBi |
#24 |
Correcto
|
0.77 s | 57 KBi |
#25 |
Tiempo límite excedido
|
1.071 s | 56 KBi |
#include <bits/stdc++.h> #define REP(i, n) for (int i = 0; i < n; i++) #define pb push_back #define ff first #define ss second #define ii pair<int, int> #define vi vector<int> #define vii vector<ii> #define lli long long int #define fast_io \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); using namespace std; ostream &operator<<(ostream &os, const vector<int> &v) { for (auto const &i : v) { os << i << " "; } os << endl; return os; } const lli mod = (1e9) + 7; const int N = 1e4 + 1; int main() { fast_io; lli n, r; cin >> n >> r; const lli LOG2 = log2(1e18) + 1; vector<vector<lli>> g(n); vector<vector<lli>> jump(n, vector<lli>(LOG2, -1)); vi visited(n, false); lli v; REP(u, n) { cin >> v; g[u].pb(v); jump[u][0] = v; } for (lli j = 1; j < LOG2; j++) { for (lli u = 0; u < n; u++) { // cout << "start "<< u << " : " << j << endl; // cout << jump[u][j] << endl; // cout << jump[u][j-1] << endl; // cout << jump[jump[u][j-1]][j-1] << endl; jump[u][j] = jump[jump[u][j - 1]][j - 1]; } } function<lli(lli, lli)> go = [&](lli u, lli pasos) { lli bit = 1ll << (LOG2 - 1); int j = LOG2-1; while (bit > 0) { if (bit & pasos) { u = jump[u][j]; //pasos -= (1ll << j); } bit >>= 1; j--; } return u; }; vi ans(n); REP(i, n) { lli pos = go(i, r); ans[pos] = i + 1; } cout << ans << endl; return 0; }