Problem:
Score : 400 points

Problem Statement

Takahashi will play a game using a piece on an array of squares numbered 1, 2, \cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \cdots, N: P_1, P_2, \cdots, P_N.

Now, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):

In one move, if the piece is now on Square i (1 \leq i \leq N), move it to Square P_i. Here, his score increases by C_{P_i}.

Help him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)

Constraints

2 \leq N \leq 5000

1 \leq K \leq 10^9

1 \leq P_i \leq N

P_i \neq i

P_1, P_2, \cdots, P_N are all different.

-10^9 \leq C_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
P_1 P_2 \cdots P_N
C_1 C_2 \cdots C_N

Output

Print the maximum possible score at the end of the game.

Sample Input 1

5 2
2 4 5 1 3
3 4 -10 -8 8

Sample Output 1

8

When we start at some square of our choice and make at most two moves, we have the following options:

If we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.

If we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.

If we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.

If we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.

If we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.

The maximum score achieved is 8.

Sample Input 2

2 3
2 1
10 -7

Sample Output 2

13

Sample Input 3

3 3
3 1 2
-1000 -2000 -3000

Sample Output 3

-1000

We have to make at least one move.

Sample Input 4

10 58
9 1 6 7 8 4 3 2 10 5
695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719

Sample Output 4

29507023469

The absolute value of the answer may be enormous.

Solution in Rust (1.42.0) (judge verdict: Accepted)

use proconio::input;

use proconio::marker::{Chars, Usize1};
#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused)]
const ALPHA_SMALL: [char; 26] = [
    'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
    't', 'u', 'v', 'w', 'x', 'y', 'z',
];
#[allow(unused)]
const ALPHA: [char; 26] = [
    'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S',
    'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
];
fn main() {
    input!(N: usize, K: i64);
    input!(P: [Usize1; N]);
    input!(C: [i64; N]);
    let mut ans = std::i64::MIN;

    let p = parse(&P, &C);
    for g in &p {
        let L = g.len();
        let cs = calc(g, K);
        let sum = cs[L - 1];
        let m = K as usize % L;
        let n = K / L as i64;
        //println!("{:?}", cs);
        // for (i, &cost) in cs.iter().enumerate() {
        //     ans = max(ans, cost);
        //     if sum <= 0 || (K as usize) < L {
        //         continue;
        //     }
        //     for j in 1..=(K as usize % L) {
        //         ans = max(ans, sum * (K / L as i64) + cs[j - 1]);
        //     }
        //     ans = max(ans, sum * (K / L as i64));
        // }
        if sum <= 0 {
            for &cost in &cs {
                ans = max(ans, cost);
            }
        } else {
            for i in 0..=m {
                if i == 0 {
                    ans = max(ans, sum * n);
                } else {
                    ans = max(ans, sum * n + cs[i - 1]);
                }
            }
            if n > 0 {
                for i in 0..L {
                    if i == 0 {
                        ans = max(ans, sum * (n - 1));
                    } else {
                        ans = max(ans, sum * (n - 1) + cs[i - 1]);
                    }
                }
            }
        }
    }

    println!("{}", ans);
    //println!("{:?}", p);
}

fn calc(g: &Vec<(usize, i64)>, K: i64) -> Vec<i64> {
    let mut ret = vec![std::i64::MIN; g.len()];
    let L = g.len();
    for start in 0..L {
        let mut cost = 0;
        for pos in 0..L {
            cost += g[(start + pos) % L].1;
            ret[pos] = max(ret[pos], cost);
        }
    }

    ret
}

//単一視点から目的のノードまでの最短距離、ただし全ての辺の重みが等しいグラフに限る
fn parse(g: &Vec<usize>, cost: &Vec<i64>) -> Vec<Vec<(usize, i64)>> {
    let N = g.len();
    let mut ret = Vec::new();
    let mut visit = vec![false; N];

    for start in 0..N {
        if visit[start] {
            continue;
        }
        let mut now = start;
        let mut h = Vec::new();
        while !visit[now] {
            visit[now] = true;
            h.push((now, cost[g[now]]));
            now = g[now];
        }

        ret.push(h);
    }

    ret
}