Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <cmath>
- using namespace std;
- int logs[100001];
- void fillLogs(int n) {
- logs[1] = 0;
- int start = 1;
- int toPush = 0;
- while (true) {
- int i = start;
- for (; i < start * 2 && i < n; i++) {
- logs[i] = toPush;
- }
- if (i >= n) break;
- start <<= 1;
- toPush++;
- }
- }
- int main() {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- cout.tie(nullptr);
- int n;
- cin >> n;
- fillLogs(n + 1);
- vector<vector<int>> dp(n + 1, vector<int>(logs[n] + 1));
- for (int i = 1; i <= n; ++i) {
- cin >> dp[i][0];
- }
- for (int j = 1; j <= logs[n]; ++j) {
- for (int i = 1; i <= n; ++i) {
- dp[i][j] = dp[dp[i][j - 1]][j - 1];
- }
- }
- for (int i = 1; i <= n; ++i) {
- cout << i << ": ";
- for (int j = 0; j <= logs[n]; ++j) {
- if (dp[i][j] == 0) break;
- cout << dp[i][j] << " ";
- }
- cout << '\n';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement