#713853 (Rust) No.1542 ぽんぽんぽん ぽんぽんぽんぽん ぽんぽんぽん

• 問題: No.1542 ぽんぽんぽん ぽんぽんぽんぽん ぽんぽんぽん
• ユーザー: koba-e964
• 提出日時: 2021-11-06 20:02:14
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 336 ms / 2,000 ms
• コード長: 2,426 bytes
• コンパイル時間: 14,967 ms
• コンパイル使用メモリ: 379,352 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-07 19:02:22
• 合計ジャッジ時間: 20,018 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 30

ソースコード

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
use std::cmp::*;
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr,) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}
macro_rules! read_value {
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
// Tags: interval-dp
fn main() {
    input! {
        n: usize,
        s: chars,
    }
    let pon = ['p', 'o', 'n'];
    const INF: i32 = 1 << 28;
    let mut dp = vec![vec![[-INF; 3]; n + 1]; n];
    for i in 0..n {
        for j in i..n + 1 {
            dp[i][j][0] = 0;
        }
    }
    for t in 3..n + 1 {
        for i in 0..n - t + 1 {
            let j = i + t;
            for b in 0..3 {
                let mut ma = -INF;
                if b <= 1 {
                    for k in 0..3 {
                        if s[i..i + k] == pon[..k] && s[j + k - 3..j] == pon[k..]
                        {
                            ma = max(ma, 1 + dp[i + k][j + k - 3][0]);
                        }
                    }
                }
                for c in 0..b + 1 {
                    for k in i + 1..j {
                        ma = max(ma, dp[i][k][c] + dp[k][j][b - c]);
                    }
                }
                if s[i] == 'p' && s[j - 1] == 'n' && b <= 1 {
                    for k in i + 1..j - 1 {
                        if s[k] == 'o' && dp[i + 1][k][0] >= 0 && dp[k + 1][j - 1][0] >= 0 {
                            ma = max(ma, 1 + dp[i + 1][k][0] + dp[k + 1][j - 1][0]);
                        }
                    }
                }
                ma = max(ma, dp[i][j - 1][b]);
                ma = max(ma, dp[i + 1][j][b]);
                dp[i][j][b] = ma;
            }
        }
    }
    println!("{}", max(-1, dp[0][n][2] - 2));
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX