結果

問題 No.2205 Lights Out on Christmas Tree
ユーザー Moss_LocalMoss_Local
提出日時 2023-02-03 21:44:38
言語 Rust
(1.68.1)
結果
AC  
実行時間 91 ms / 2,000 ms
コード長 6,697 bytes
コンパイル時間 1,109 ms
コンパイル使用メモリ 149,528 KB
実行使用メモリ 52,420 KB
最終ジャッジ日時 2023-09-15 17:25:49
合計ジャッジ時間 5,308 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 1 ms
4,376 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 65 ms
30,428 KB
testcase_12 AC 66 ms
30,544 KB
testcase_13 AC 65 ms
30,504 KB
testcase_14 AC 63 ms
30,432 KB
testcase_15 AC 85 ms
52,420 KB
testcase_16 AC 43 ms
18,784 KB
testcase_17 AC 44 ms
18,816 KB
testcase_18 AC 1 ms
4,376 KB
testcase_19 AC 75 ms
30,464 KB
testcase_20 AC 78 ms
27,332 KB
testcase_21 AC 78 ms
27,340 KB
testcase_22 AC 68 ms
31,300 KB
testcase_23 AC 66 ms
27,372 KB
testcase_24 AC 72 ms
28,460 KB
testcase_25 AC 80 ms
27,376 KB
testcase_26 AC 91 ms
27,372 KB
testcase_27 AC 74 ms
30,920 KB
testcase_28 AC 68 ms
31,276 KB
testcase_29 AC 73 ms
32,172 KB
testcase_30 AC 91 ms
27,336 KB
testcase_31 AC 76 ms
31,164 KB
testcase_32 AC 79 ms
28,940 KB
testcase_33 AC 79 ms
28,640 KB
testcase_34 AC 65 ms
27,384 KB
testcase_35 AC 89 ms
27,664 KB
testcase_36 AC 89 ms
27,692 KB
testcase_37 AC 65 ms
27,396 KB
testcase_38 AC 91 ms
27,392 KB
testcase_39 AC 75 ms
30,280 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around type
  --> Main.rs:64:15
   |
64 | fn readi() -> (i64) {
   |               ^   ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
64 - fn readi() -> (i64) {
64 + fn readi() -> i64 {
   |

warning: unused variable: `i`
   --> Main.rs:203:9
    |
203 |     for i in 0..n - 1 {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: 2 warnings emitted

ソースコード

diff # 

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
// const MOD: i64 = 1000000007;
const MOD: i64 = 998244353;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        println!("{}", $x);
    };
}

macro_rules! d {
    ($x:expr) => {
        println!("{:?}", $x);
    };
}
#[allow(unused_macros)]
pub mod macros {
    macro_rules! min { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); std::cmp::min($x, y) } }}
    macro_rules! max { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); std::cmp::max($x, y) } }}
    macro_rules! chmin { ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); if $x > y { $x = y; true } else { false } }}}
    macro_rules! chmax { ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); if $x < y { $x = y; true } else { false } }}}
    macro_rules! multi_vec { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_vec![$element; ($($lens),*)]; $len] ); ($element: expr; ($len: expr)) => ( vec![$element; $len] ); }
    macro_rules! multi_box_array { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_box_array![$element; ($($lens),*)]; $len].into_boxed_slice() ); ($element: expr; ($len: expr)) => ( vec![$element; $len].into_boxed_slice() ); }
    #[allow(unused_imports)]
    pub(super) use {chmax, chmin, max, min, multi_box_array, multi_vec};
}
use macros::*;
fn main() {
    solve();
}

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn readi() -> (i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    iter.next().unwrap().parse::<i64>().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn dfs(
    v: usize,
    graph: &Vec<Vec<(usize, usize)>>,
    used: &mut Vec<usize>,
    data: &mut Vec<usize>,
    c: &mut Vec<usize>,
) {
    used[v] = 1;
    let mut cnt = 0;
    for i in graph[v].iter() {
        let nv = (*i).0;
        if used[nv] == 1 {
            continue;
        }
        dfs(nv, &graph, used, data, c);
        cnt += c[nv];
        data[v] += data[nv];
    }
    data[v] += cnt;
    if (cnt + c[v]) % 2 == 1 {
        c[v] = 1;
    } else {
        c[v] = 0;
    }

    return;
}
fn solve() {
    let n: usize = read();
    let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize];
    for i in 0..n - 1 {
        let (mut a, mut b) = readuu();
        a -= 1;
        b -= 1;
        graph[a].push((b, 1));
        graph[b].push((a, 1));
    }
    let mut c: Vec<usize> = read_vec();
    for i in 0..n {
        c[i] ^= 1;
    }
    let mut root = 0;
    for i in 0..n {
        if c[i] == 1 {
            root = i;
            break;
        }
    }
    let mut used = vec![0; n];
    let mut data = vec![0; n];
    dfs(root, &graph, &mut used, &mut data, &mut c);
    if c[root] == 1 {
        p!(-1);
        return;
    }
    p!(data[root]);

    return;
}
0