結果

問題 No.1295 木と駒
ユーザー akakimidoriakakimidori
提出日時 2020-11-20 22:23:37
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 2,932 bytes
コンパイル時間 14,748 ms
コンパイル使用メモリ 379,156 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-23 13:19:28
合計ジャッジ時間 15,761 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 7 WA * 6 RE * 35
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `std::io::Write`
  --> src/main.rs:51:5
   |
51 | use std::io::Write;
   |     ^^^^^^^^^^^^^^
   |
   = note: `#[warn(unused_imports)]` on by default

warning: unused variable: `out`
   --> src/main.rs:103:13
    |
103 |     let mut out = std::io::BufWriter::new(out.lock());
    |             ^^^ help: if this is intentional, prefix it with an underscore: `_out`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:103:9
    |
103 |     let mut out = std::io::BufWriter::new(out.lock());
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

ソースコード

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

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
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_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_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 ----------
use std::io::Write;
fn run() {
input! {
n: usize,
e: [(usize1, usize1); n - 1],
}
assert!(n < 5000);
let mut g = vec![vec![]; n];
for &(a, b) in e.iter() {
g[a].push(b);
g[b].push(a);
}
g.iter_mut().for_each(|g| g.sort());
for root in 0..n {
let mut topo = vec![root];
let mut parent = vec![n; n];
for i in 0..n {
let v = topo[i];
for &u in g[v].iter() {
if u != parent[v] {
parent[u] = v;
topo.push(u);
}
}
}
let mut dp = vec![(true, true, n); n];
for &v in topo.iter().rev() {
let mut child = vec![];
for &u in g[v].iter() {
if u != parent[v] {
child.push(dp[u]);
}
}
if child.is_empty() {
continue;
}
dp[v].0 = child.iter().all(|p| p.0 && p.2 > v);
let len = child.len();
for p in child.iter().take(len - 1) {
dp[v].1 &= p.0 && p.2 > v;
}
dp[v].1 &= child[len - 1].1;
dp[v].2 = *g[v].iter().filter(|p| **p != parent[v]).min().unwrap();
}
if dp[root].1 {
println!("Yes");
} else {
println!("No");
}
}
let out = std::io::stdout();
let mut out = std::io::BufWriter::new(out.lock());
}
fn main() {
run();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0