結果
問題 | No.2638 Initial fare |
ユーザー | Moss_Local |
提出日時 | 2024-02-19 21:34:00 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 107 ms / 2,000 ms |
コード長 | 4,258 bytes |
コンパイル時間 | 13,224 ms |
コンパイル使用メモリ | 394,648 KB |
実行使用メモリ | 28,432 KB |
最終ジャッジ日時 | 2024-09-29 01:29:55 |
合計ジャッジ時間 | 15,199 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,820 KB |
testcase_02 | AC | 1 ms
6,816 KB |
testcase_03 | AC | 1 ms
6,816 KB |
testcase_04 | AC | 107 ms
24,992 KB |
testcase_05 | AC | 100 ms
26,268 KB |
testcase_06 | AC | 1 ms
6,816 KB |
testcase_07 | AC | 89 ms
26,508 KB |
testcase_08 | AC | 83 ms
26,228 KB |
testcase_09 | AC | 91 ms
28,116 KB |
testcase_10 | AC | 86 ms
28,432 KB |
testcase_11 | AC | 1 ms
6,820 KB |
testcase_12 | AC | 90 ms
26,100 KB |
testcase_13 | AC | 74 ms
25,028 KB |
testcase_14 | AC | 84 ms
27,904 KB |
testcase_15 | AC | 86 ms
28,352 KB |
testcase_16 | AC | 1 ms
6,820 KB |
testcase_17 | AC | 99 ms
27,936 KB |
testcase_18 | AC | 85 ms
26,776 KB |
testcase_19 | AC | 96 ms
28,180 KB |
testcase_20 | AC | 102 ms
27,732 KB |
testcase_21 | AC | 102 ms
26,344 KB |
testcase_22 | AC | 1 ms
6,816 KB |
testcase_23 | AC | 97 ms
24,572 KB |
testcase_24 | AC | 101 ms
25,452 KB |
testcase_25 | AC | 0 ms
6,816 KB |
testcase_26 | AC | 97 ms
25,472 KB |
testcase_27 | AC | 96 ms
25,380 KB |
コンパイルメッセージ
warning: variable does not need to be mutable --> src/main.rs:122:9 | 122 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> src/main.rs:128:9 | 128 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:133:9 | 133 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:139:9 | 139 | let mut vec: Vec<f64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:144:9 | 144 | let mut vec: Vec<char> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:149:9 | 149 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:154:9 | 154 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:160:9 | 160 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: unused variable: `i` --> src/main.rs:175:9 | 175 | 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 core::num; use std::cmp::*; use std::fmt::*; use std::hash::*; use std::iter::FromIterator; 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 MOD1: i64 = 1000000007; const MOD9: i64 = 998244353; const MOD: i64 = MOD9; // const MOD: i64 = MOD2; const UMOD: usize = MOD as usize; const M_PI: f64 = 3.14159265358979323846; // use proconio::input; // 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) => { //if expr println!("{}", $x); }; } macro_rules! vp { // vector print separate with space ($x:expr) => { println!( "{}", $x.iter() .map(|x| x.to_string()) .collect::<Vec<_>>() .join(" ") ); }; } macro_rules! d { ($x:expr) => { eprintln!("{:?}", $x); }; } macro_rules! yn { ($val:expr) => { if $val { println!("Yes"); } else { println!("No"); } }; } macro_rules! map{ // declear btreemap ($($key:expr => $val:expr),*) => { { let mut map = ::std::collections::BTreeMap::new(); $( map.insert($key, $val); )* map } }; } macro_rules! set{ // declear btreemap ($($key:expr),*) => { { let mut set = ::std::collections::BTreeSet::new(); $( set.insert($key); )* set } }; } 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 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 vec: Vec<i64> = read_vec(); (vec[0], vec[1]) } #[allow(dead_code)] fn readiii() -> (i64, i64, i64) { let mut vec: Vec<i64> = read_vec(); (vec[0], vec[1], vec[2]) } #[allow(dead_code)] fn readuu() -> (usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1]) } #[allow(dead_code)] fn readff() -> (f64, f64) { let mut vec: Vec<f64> = read_vec(); (vec[0], vec[1]) } fn readcc() -> (char, char) { let mut vec: Vec<char> = read_vec(); (vec[0], vec[1]) } fn readuuu() -> (usize, usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1], vec[2]) } #[allow(dead_code)] fn readiiii() -> (i64, i64, i64, i64) { let mut vec: Vec<i64> = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } fn read_imat(h: usize) -> Vec<Vec<i64>> { (0..h).map(|_| read_vec()).collect() } fn read_cmat(h: usize) -> Vec<Vec<char>> { (0..h).map(|_| read::<String>().chars().collect()).collect() } 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 res = 0; for i in 0..n { let x = graph[i].len() as i64; res += x; res += x * (x - 1); } for e in es { if graph[e.0].len() == 0 || graph[e.1].len() == 0 { continue; } res += ((graph[e.0].len() - 1) * (graph[e.1].len() - 1)) as i64 * 2; } p!(res / 2); return; }