#816190 (Rust) No.95 Alice and Graph

• 問題: No.95 Alice and Graph
• ユーザー: akakimidori
• 提出日時: 2022-11-15 05:04:16
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 1,523 ms / 5,000 ms
• コード長: 3,623 bytes
• コンパイル時間: 23,546 ms
• コンパイル使用メモリ: 378,340 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-16 05:50:09
• 合計ジャッジ時間: 18,431 ms
• ジャッジサーバーID （参考情報）: judge4 / judge6

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

ソースコード

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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
fn main() {
    input! {
        n: usize,
        m: usize,
        k: i8,
        e: [(usize1, usize1); m],
    }
    let inf = std::i8::MAX / 2;
    let mut g = vec![vec![k + 1; n]; n];
    for i in 0..n {
        g[i][i] = 0;
    }
    for (a, b) in e {
        g[a][b] = 1;
        g[b][a] = 1;
    }
    for k in 0..n {
        for i in 0..n {
            for j in 0..n {
                g[i][j] = g[i][j].min(g[i][k] + g[k][j]);
            }
        }
    }
    let can = |bit: usize| -> bool {
        if bit.count_ones() > (k as u32) {
            return false;
        }
        let n = bit.count_ones() as usize;
        let mut dp = vec![vec![k + 1; 1 << n]; n];
        let mut x = 0;
        let mut pos = vec![];
        for i in 0..60 {
            if bit >> i & 1 == 1 {
                dp[x][1 << x] = g[0][i];
                pos.push(i);
                x += 1;
            }
        }
        for bit in 1..(1 << n) {
            for last in 0..n {
                if dp[last][bit] == inf {
                    continue;
                }
                for next in 0..n {
                    if bit >> next & 1 == 0 {
                        let d = dp[last][bit] + g[pos[last]][pos[next]];
                        dp[next][bit | (1 << next)].chmin(d);
                    }
                }
            }
        }
        dp.iter().any(|dp| dp[(1 << n) - 1] <= k)
    };
    let mut bit = 0;
    for i in (1..n).rev() {
        if can(bit | (1 << i)) {
            bit |= 1 << i;
        }
    }
    let mut ans = 0u64;
    for i in 0..n {
        if bit >> i & 1 == 1 {
            ans += (1 << i) - 1;
        }
    }
    println!("{}", ans);
}
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}
#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}
#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
// ---------- begin chmin, chmax ----------
pub trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}
impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX