結果
問題 | No.1817 Reversed Edges |
ユーザー | Moss_Local |
提出日時 | 2022-01-21 22:04:47 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 176 ms / 2,000 ms |
コード長 | 6,365 bytes |
コンパイル時間 | 11,405 ms |
コンパイル使用メモリ | 375,560 KB |
実行使用メモリ | 25,216 KB |
最終ジャッジ日時 | 2024-11-26 00:15:00 |
合計ジャッジ時間 | 15,636 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 0 ms
5,248 KB |
testcase_05 | AC | 0 ms
5,248 KB |
testcase_06 | AC | 0 ms
5,248 KB |
testcase_07 | AC | 145 ms
14,592 KB |
testcase_08 | AC | 65 ms
8,064 KB |
testcase_09 | AC | 138 ms
13,952 KB |
testcase_10 | AC | 76 ms
8,960 KB |
testcase_11 | AC | 104 ms
11,008 KB |
testcase_12 | AC | 164 ms
16,384 KB |
testcase_13 | AC | 170 ms
16,384 KB |
testcase_14 | AC | 165 ms
16,256 KB |
testcase_15 | AC | 167 ms
16,384 KB |
testcase_16 | AC | 168 ms
16,384 KB |
testcase_17 | AC | 162 ms
16,256 KB |
testcase_18 | AC | 170 ms
16,384 KB |
testcase_19 | AC | 176 ms
16,384 KB |
testcase_20 | AC | 170 ms
16,384 KB |
testcase_21 | AC | 172 ms
16,256 KB |
testcase_22 | AC | 137 ms
17,536 KB |
testcase_23 | AC | 141 ms
17,536 KB |
testcase_24 | AC | 148 ms
25,216 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> src/main.rs:70:15 | 70 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 70 - fn readi() -> (i64) { 70 + fn readi() -> i64 { | warning: unused variable: `i` --> src/main.rs:208:9 | 208 | for i in 0..n - 1 { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default
ソースコード
// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] use std::any::Any; use std::cmp::Ordering::*; use std::collections::*; use std::convert::*; use std::convert::{From, Into}; use std::error::Error; use std::f64::consts::PI; use std::fmt::Debug; use std::fmt::Display; use std::fs::File; use std::hash::Hash; use std::io::prelude::*; use std::io::*; use std::iter::Filter; use std::marker::Copy; use std::mem::*; use std::ops::Bound::*; use std::ops::RangeBounds; use std::ops::{Add, Mul, Neg, Sub}; use std::slice::from_raw_parts; use std::str; use std::vec; const INF: i64 = 1223372036854775807; const UINF: usize = INF as usize; // const FINF: f64 = 122337203685.0; const LINF: i64 = 2147483647; const FINF: f64 = LINF as f64; const INF128: i128 = 1223372036854775807000000000000; // const MOD: i64 = 1000000007; const MOD: i64 = 998244353; const MPI: f64 = 3.14159265358979323846264338327950288f64; // const MOD: i64 = INF; const UMOD: usize = MOD as usize; use std::cmp::*; 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); }; } // use str::Chars; // 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(), ) } 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(), ) } #[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(), ) } 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<i64>) { used[v] = 1; for i in graph[v].iter() { let nv = (*i).0; if used[nv] == 1 { continue; } data[nv] = data[v] + 1; dfs(nv, &graph, used, data); } return; } fn dfs2(v: usize, graph: &Vec<Vec<(usize, usize)>>, used: &mut Vec<usize>, data: &mut Vec<i64>) { used[v] = 1; for i in graph[v].iter() { let nv = (*i).0; if used[nv] == 1 { continue; } data[nv] += data[v]; dfs2(nv, &graph, used, data); } return; } fn solve() { let n: usize = read(); let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize]; let mut es = vec![]; 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)); es.push((a, b)); } let mut used = vec![0; n]; let mut data1 = vec![0; n]; dfs(0, &graph, &mut used, &mut data1); let mut data2 = vec![0; n]; for mut x in es { if x.0 > x.1 { //swap let tmp = x.0; x.0 = x.1; x.1 = tmp; } if (data1[x.0] < data1[x.1]) && (x.1 > x.0) { data2[x.1] += 1; } else { data2[0] += 1; data2[x.0] -= 1; } } let mut used = vec![0; n]; // d!(data2); dfs2(0, &graph, &mut used, &mut data2); for i in 0..n { p!(data2[i]); } return; } fn main() { solve(); }