func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 1e5 + 5;   const int mod = 1e9 + 7;   long long qpow(long long a, long long b) {     long long res = 1;     for (; b; b >>= 1) {       if (b & 1) res = res * a % mod;       a = a * a % mod;     }     return res;   }   struct graph {     int head[maxn], nxt[maxn << 1], to[maxn << 1], w[maxn << 1], sz;     void init() { memset(head, -1, sizeof(head)); }     graph() { init(); }     void push(int a, int b, int c) {       nxt[sz] = head[a], to[sz] = b, w[sz] = c, head[a] = sz++;     }     int& operator[](const int a) { return to[a]; }   };   long long dist[maxn][40], fi[maxn][40], mi[maxn][40];   int to[maxn], w[maxn];   int main() {     int n;     long long k;     cin >> n >> k;     for (int i = 0; i < n; ++i) scanf( %d , &to[i]);     for (int i = 0; i < n; ++i) {       scanf( %d , &w[i]);       dist[i][0] = w[i];       mi[i][0] = w[i];       fi[i][0] = to[i];     }     for (int i = 1; i <= 39; ++i) {       for (int j = 0; j < n; ++j) {         dist[j][i] = dist[j][i - 1] + dist[fi[j][i - 1]][i - 1];         fi[j][i] = fi[fi[j][i - 1]][i - 1];         mi[j][i] = min(mi[j][i - 1], mi[fi[j][i - 1]][i - 1]);       }     }     for (int i = 0; i < n; ++i) {       long long mix = 1e18;       long long ans = 0;       long long res = k;       int now = i;       for (int j = 39; j >= 0; --j) {         if (res >= (1ll << j)) {           ans += dist[now][j];           mix = min(mix, mi[now][j]);           now = fi[now][j];           res -= (1ll << j);         }       }       printf( %lld %lld n , ans, mix);     }     return 0;   }   