#209065 (Rust) No.572 妖精の演奏

• 問題: No.572 妖精の演奏
• ユーザー: hatoo
• 提出日時: 2017-10-12 12:53:20
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 1,280 ms / 2,000 ms
• コード長: 3,169 bytes
• コンパイル時間: 13,793 ms
• コンパイル使用メモリ: 379,164 KB
• 実行使用メモリ: 111,360 KB
• 最終ジャッジ日時: 2024-11-17 10:48:28
• 合計ジャッジ時間: 24,522 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
other	AC * 20

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{HashMap, HashSet};
mod util {
    use std::io::stdin;
    use std::str::FromStr;
    use std::fmt::Debug;
    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }
    #[allow(dead_code)]
    pub fn get<T: FromStr>() -> T
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().parse().unwrap()
    }
    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }
    #[allow(dead_code)]
    pub fn get2<T: FromStr, U: FromStr>() -> (T, U)
    where
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }
    #[allow(dead_code)]
    pub fn get3<S: FromStr, T: FromStr, U: FromStr>() -> (S, T, U)
    where
        <S as FromStr>::Err: Debug,
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }
}
#[allow(unused_macros)]
macro_rules! debug {
    ($x: expr) => {
        println!("{}: {:?}", stringify!($x), $x)
    }
}
fn main() {
    let n: usize = util::get();
    let m: usize = util::get();
    let a: Vec<Vec<usize>> = (0..m).map(|_| util::gets()).collect();
    let b = 10000;
    let mut dp = vec![vec![vec![0; m]; b + 1]; m];
    for i in 1..b + 1 {
        for k in 0..m {
            for s in 0..m {
                if i == 1 {
                    dp[s][i][k] = a[s][k];
                } else {
                    for j in 0..m {
                        dp[s][i][k] = max(dp[s][i][k], dp[s][i - 1][j] + a[j][k]);
                    }
                }
            }
        }
    }
    let c = n / b;
    let rest = n - c * b - 1;
    let mut dp2 = vec![vec![0; m]; c + 2];
    for i in 1..c + 2 {
        for k in 0..m {
            if i == c + 1 {
                for j in 0..m {
                    dp2[i][k] = max(dp2[i][k], dp2[i - 1][j] + dp[j][rest][k]);
                }
            } else {
                for j in 0..m {
                    dp2[i][k] = max(dp2[i][k], dp2[i - 1][j] + dp[j][b][k]);
                }
            }
        }
    }
    println!("{}", dp2[c + 1].iter().max().cloned().unwrap())
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX