結果

問題 No.845 最長の切符
ユーザー koba-e964
提出日時 2021-10-05 11:17:33
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 59 ms / 3,000 ms
コード長 2,397 bytes
コンパイル時間 12,524 ms
コンパイル使用メモリ 402,236 KB
実行使用メモリ 10,240 KB
最終ジャッジ日時 2024-07-23 02:33:37
合計ジャッジ時間 14,346 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `BufWriter`
 --> src/main.rs:5:22
  |
5 | use std::io::{Write, BufWriter};
  |                      ^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused import: `Write`
 --> src/main.rs:5:15
  |
5 | use std::io::{Write, BufWriter};
  |               ^^^^^

ソースコード

diff #
プレゼンテーションモードにする

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// 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, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };
($next:expr, [ $t:tt ; $len:expr ]) => {
(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
};
($next:expr, chars) => {
read_value!($next, String).chars().collect::<Vec<char>>()
};
($next:expr, usize1) => (read_value!($next, usize) - 1);
($next:expr, [ $t:tt ]) => {{
let len = read_value!($next, usize);
read_value!($next, [$t; len])
}};
($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
fn main() {
input! {
n: usize, m: usize,
abc: [(usize1, usize1, i64); m],
}
const INF: i64 = 1 << 50;
let mut dp = vec![vec![-INF; 1 << n]; n];
for i in 0..n {
dp[i][1 << i] = 0;
}
let mut dist = vec![vec![-INF; n]; n];
for &(a, b, c) in &abc {
dist[a][b] = max(dist[a][b], c);
dist[b][a] = max(dist[b][a], c);
}
for bits in 3usize..1 << n {
if bits.count_ones() <= 1 {
continue;
}
for i in 0..n {
if (bits & 1 << i) == 0 { continue; }
let mut me = -INF;
for j in 0..n {
if i == j || (bits & 1 << j) == 0 { continue; }
me = max(me, dp[j][bits ^ 1 << i] + dist[i][j]);
}
dp[i][bits] = me;
}
}
let mut ans = -INF;
for i in 0..n {
for bits in 0..1 << n {
ans = max(ans, dp[i][bits]);
}
}
println!("{}", ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0