結果
問題 | No.1227 I hate ThREE |
ユーザー |
![]() |
提出日時 | 2020-09-11 22:38:07 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 41 ms / 2,000 ms |
コード長 | 7,741 bytes |
コンパイル時間 | 14,452 ms |
コンパイル使用メモリ | 400,996 KB |
実行使用メモリ | 25,472 KB |
最終ジャッジ日時 | 2025-01-02 05:38:14 |
合計ジャッジ時間 | 12,700 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
// ---------- begin ModInt ----------mod modint {#[allow(dead_code)]pub struct Mod;impl ConstantModulo for Mod {const MOD: u32 = 1_000_000_007;}#[allow(dead_code)]pub struct StaticMod;static mut STATIC_MOD: u32 = 0;impl Modulo for StaticMod {fn modulo() -> u32 {unsafe { STATIC_MOD }}}#[allow(dead_code)]impl StaticMod {pub fn set_modulo(p: u32) {unsafe {STATIC_MOD = p;}}}use std::marker::*;use std::ops::*;pub trait Modulo {fn modulo() -> u32;}pub trait ConstantModulo {const MOD: u32;}impl<T> Modulo for TwhereT: ConstantModulo,{fn modulo() -> u32 {T::MOD}}pub struct ModInt<T>(pub u32, PhantomData<T>);impl<T> Clone for ModInt<T> {fn clone(&self) -> Self {ModInt::new_unchecked(self.0)}}impl<T> Copy for ModInt<T> {}impl<T: Modulo> Add for ModInt<T> {type Output = ModInt<T>;fn add(self, rhs: Self) -> Self::Output {let mut d = self.0 + rhs.0;if d >= T::modulo() {d -= T::modulo();}ModInt::new_unchecked(d)}}impl<T: Modulo> AddAssign for ModInt<T> {fn add_assign(&mut self, rhs: Self) {*self = *self + rhs;}}impl<T: Modulo> Sub for ModInt<T> {type Output = ModInt<T>;fn sub(self, rhs: Self) -> Self::Output {let mut d = T::modulo() + self.0 - rhs.0;if d >= T::modulo() {d -= T::modulo();}ModInt::new_unchecked(d)}}impl<T: Modulo> SubAssign for ModInt<T> {fn sub_assign(&mut self, rhs: Self) {*self = *self - rhs;}}impl<T: Modulo> Mul for ModInt<T> {type Output = ModInt<T>;fn mul(self, rhs: Self) -> Self::Output {let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;ModInt::new_unchecked(v as u32)}}impl<T: Modulo> MulAssign for ModInt<T> {fn mul_assign(&mut self, rhs: Self) {*self = *self * rhs;}}impl<T: Modulo> Neg for ModInt<T> {type Output = ModInt<T>;fn neg(self) -> Self::Output {if self.0 == 0 {Self::zero()} else {Self::new_unchecked(T::modulo() - self.0)}}}impl<T> std::fmt::Display for ModInt<T> {fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {write!(f, "{}", self.0)}}impl<T: Modulo> std::str::FromStr for ModInt<T> {type Err = std::num::ParseIntError;fn from_str(s: &str) -> Result<Self, Self::Err> {let val = s.parse::<u32>()?;Ok(ModInt::new(val))}}impl<T: Modulo> From<usize> for ModInt<T> {fn from(val: usize) -> ModInt<T> {ModInt::new_unchecked((val % T::modulo() as usize) as u32)}}impl<T: Modulo> From<u64> for ModInt<T> {fn from(val: u64) -> ModInt<T> {ModInt::new_unchecked((val % T::modulo() as u64) as u32)}}impl<T: Modulo> From<i64> for ModInt<T> {fn from(val: i64) -> ModInt<T> {let m = T::modulo() as i64;ModInt::new((val % m + m) as u32)}}#[allow(dead_code)]impl<T> ModInt<T> {pub fn new_unchecked(d: u32) -> Self {ModInt(d, PhantomData)}pub fn zero() -> Self {ModInt::new_unchecked(0)}pub fn one() -> Self {ModInt::new_unchecked(1)}pub fn is_zero(&self) -> bool {self.0 == 0}}#[allow(dead_code)]impl<T: Modulo> ModInt<T> {pub fn new(d: u32) -> Self {ModInt::new_unchecked(d % T::modulo())}pub fn pow(&self, mut n: u64) -> Self {let mut t = Self::one();let mut s = *self;while n > 0 {if n & 1 == 1 {t *= s;}s *= s;n >>= 1;}t}pub fn inv(&self) -> Self {assert!(self.0 != 0);self.pow(T::modulo() as u64 - 2)}}#[allow(dead_code)]pub fn mod_pow(r: u64, mut n: u64, m: u64) -> u64 {let mut t = 1 % m;let mut s = r % m;while n > 0 {if n & 1 == 1 {t = t * s % m;}s = s * s % m;n >>= 1;}t}}// ---------- end ModInt ----------//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")};}//use modint::*;type M = ModInt<Mod>;fn run() {input! {n: usize,c: usize,e: [(usize1, usize1); n - 1],}let mut g = vec![vec![]; n];for (a, b) in e {g[a].push(b);g[b].push(a);}let mut q = vec![(0, 0)];for i in 0..n {let (v, p) = q[i];let g = &mut g[v];if let Some(k) = g.iter().position(|u| *u == p) {g.remove(k);}for &u in g.iter() {q.push((u, v));}}let mut rank = vec![0; n];for &(v, _) in q.iter().rev() {for &u in g[v].iter() {rank[v] = std::cmp::max(rank[v], rank[u] + 1);}}let w = std::cmp::min(c, 6 * rank[0] + 1);let mut dp = vec![vec![M::one(); w]; n];for &(v, _) in q.iter().rev() {for &u in g[v].iter() {for k in 0..w {let mut val = M::zero();if k >= 3 {val += dp[u][k - 3];}if k + 3 < w {val += dp[u][k + 3];}dp[v][k] *= val;}}}let mut ans = M::zero();if 6 * rank[0] + 1 < c {ans += dp[0].iter().take(3 * rank[0]).fold(M::zero(), |s, a| s + *a) * M::new(2);ans += dp[0][rank[0] * 3] * M::from(c - rank[0] * 6);} else {ans += dp[0].iter().fold(M::zero(), |s, a| s + *a);}println!("{}", ans);}fn main() {run();}