結果

問題 No.1333 Squared Sum
ユーザー ziitaziita
提出日時 2021-02-23 03:27:27
言語 Rust
(1.77.0 + proconio)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 9,565 bytes
コンパイル時間 17,640 ms
コンパイル使用メモリ 377,600 KB
実行使用メモリ 66,048 KB
最終ジャッジ日時 2024-09-21 22:17:04
合計ジャッジ時間 24,197 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 192 ms
33,792 KB
testcase_04 AC 191 ms
33,664 KB
testcase_05 AC 197 ms
33,688 KB
testcase_06 AC 258 ms
33,664 KB
testcase_07 AC 181 ms
33,564 KB
testcase_08 AC 150 ms
33,664 KB
testcase_09 AC 157 ms
33,920 KB
testcase_10 AC 164 ms
33,556 KB
testcase_11 AC 148 ms
33,792 KB
testcase_12 AC 199 ms
33,792 KB
testcase_13 RE -
testcase_14 AC 182 ms
52,096 KB
testcase_15 RE -
testcase_16 AC 1 ms
5,376 KB
testcase_17 AC 1 ms
5,376 KB
testcase_18 AC 1 ms
5,376 KB
testcase_19 AC 1 ms
5,376 KB
testcase_20 AC 1 ms
5,376 KB
testcase_21 AC 1 ms
5,376 KB
testcase_22 AC 1 ms
5,376 KB
testcase_23 AC 1 ms
6,940 KB
testcase_24 AC 1 ms
6,940 KB
testcase_25 AC 1 ms
6,944 KB
testcase_26 RE -
testcase_27 AC 181 ms
53,248 KB
testcase_28 RE -
testcase_29 RE -
testcase_30 AC 48 ms
15,232 KB
testcase_31 AC 27 ms
9,472 KB
testcase_32 AC 78 ms
21,028 KB
testcase_33 AC 56 ms
17,280 KB
testcase_34 AC 111 ms
27,648 KB
testcase_35 AC 74 ms
21,104 KB
testcase_36 AC 40 ms
13,440 KB
testcase_37 AC 44 ms
13,824 KB
testcase_38 AC 57 ms
15,872 KB
testcase_39 AC 87 ms
23,808 KB
testcase_40 AC 136 ms
49,024 KB
testcase_41 AC 139 ms
48,896 KB
testcase_42 AC 135 ms
49,024 KB
testcase_43 AC 137 ms
48,896 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254 より

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

// const MOD: usize = 998244353;
const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX/100;
// const INF: usize = std::usize::MAX;
// const INF: i128 = std::i128::MAX/100;

#[derive(Clone, Copy)]
struct ModInt(usize);
 
impl std::ops::Add for ModInt {
    type Output = ModInt;
    fn add(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}
 
impl std::ops::AddAssign for ModInt {
    fn add_assign(&mut self, rhs: ModInt) {
        *self = *self + rhs;
    }
}
 
impl std::ops::Sub for ModInt {
    type Output = ModInt;
    fn sub(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + MOD - rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}
 
impl std::ops::SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: ModInt) {
        *self = *self - rhs;
    }
}
 
impl std::ops::Mul for ModInt {
    type Output = ModInt;
    fn mul(self, rhs: ModInt) -> Self::Output {
        ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as usize)
    }
}
 
impl std::ops::MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: ModInt) {
        *self = *self * rhs;
    }
}
 
impl std::ops::Neg for ModInt {
    type Output = ModInt;
    fn neg(self) -> Self::Output {
        ModInt(if self.0 == 0 {0} else {MOD - self.0})
    }
}
 
/* 
impl std::fmt::Display for ModInt {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}
*/
 
#[allow(dead_code)]
impl ModInt {
    pub fn new(n: usize) -> ModInt {
        ModInt(n % MOD)
    }
    pub fn zero() -> ModInt {
        ModInt(0)
    }
    pub fn one() -> ModInt {
        ModInt(1)
    }
    pub fn pow(self, mut n: usize) -> ModInt {
        let mut t = ModInt::one();
        let mut s = self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(self) -> ModInt {
        self.pow(MOD - 2)
    }
}
// ---------- end ModInt ----------
// ---------- begin Precalc ----------
#[allow(dead_code)]
struct Precalc {
    inv: Vec<ModInt>,
    fact: Vec<ModInt>,
    ifact: Vec<ModInt>,
}
 
#[allow(dead_code)]
impl Precalc {
    pub fn new(n: usize) -> Precalc {
        let mut inv = vec![ModInt::one(); n + 1];
        let mut fact = vec![ModInt::one(); n + 1];
        let mut ifact = vec![ModInt::one(); n + 1];
        for i in 2..(n + 1) {
            inv[i] = -inv[MOD as usize % i] * ModInt(MOD / i as usize);
            fact[i] = fact[i - 1] * ModInt(i as usize);
            ifact[i] = ifact[i - 1] * inv[i];
        }
        Precalc {
            inv: inv,
            fact: fact,
            ifact: ifact,
        }
    }
    pub fn inv(&self, n: usize) -> ModInt {
        self.inv[n]
    }
    pub fn fact(&self, n: usize) -> ModInt {
        self.fact[n]
    }
    pub fn ifact(&self, n: usize) -> ModInt {
        self.ifact[n]
    }
    pub fn comb(&self, n: usize, k: usize) -> ModInt {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[k] * self.ifact[n - k]
    }
}
// ---------- end Precalc ----------

fn solve() {
    let n = read!(usize);
    let uvw = read!(usize,usize,i64;n-1);
    let mut edge = vec![vec![];n];
    for &(u,v,w) in &uvw {
        edge[u-1].push((v-1,w));
        edge[v-1].push((u-1,w));
    }
    let mut path = vec![];
    search(0,n,&edge,&mut path);
    let mut val = vec![(ModInt(0),ModInt(0),ModInt(0),ModInt(0));n];
    let mut seen = vec![false;n];
    for &i in &path {
        seen[i] = true;
        let mut list = vec![];
        let mut wlist = vec![];
        let mut ans = ModInt(0);
        for &(nxt,w) in &edge[i] {
            if !seen[nxt] {
                continue;
            }
            list.push(val[nxt]);
            wlist.push(ModInt(w as usize));
            ans += val[nxt].3;
        }
        let mut nlist = vec![];
        for i in 0..list.len() {
            let (a,b,c,_) = list[i];
            let w = wlist[i];
            let na = a + ModInt(2)*b*w + w*w*(c+ModInt(1));
            let nb = b + w*(c+ModInt(1));
            let nc = c + ModInt(1);
            nlist.push((na,nb,nc));
            // println!("{} {} {}",na.0,nb.0,nc.0);
        }
        let mut ret = (ModInt(0),ModInt(0),ModInt(0),ans);
        let mut bsum = ModInt(0);
        let mut csum = ModInt(0);
        for i in 0..nlist.len() {
            csum += nlist[i].2;
        }
        for i in 0..nlist.len() {
            let (a,b,c) = nlist[i];
            ret.3 += a*(csum-c);
            ret.3 += ModInt(2)*b*bsum;
            bsum += b;
        }
        for i in 0..nlist.len() {
            let (a,b,c) = nlist[i];
            ret.0 += a;
            ret.1 += b;
            ret.2 += c;
        }
        ret.3 += ret.0;
        // println!("{} {} {} {}",(ret.0).0,(ret.1).0,(ret.2).0,(ret.3).0);
        val[i] = ret;
    }
    let ret = dfs(0,n,&edge);

    println!("{}",(ret.3).0);
}

fn search(cur: usize, p: usize, edge: &Vec<Vec<(usize,i64)>>, mut list: &mut Vec<usize>) {
    for &(nxt,w) in &edge[cur] {
        if nxt==p {
            search(nxt,cur,&edge,&mut list);
        }
    }
    list.push(cur);
}

fn dfs(cur: usize, p: usize, edge: &Vec<Vec<(usize,i64)>>) -> (ModInt,ModInt,ModInt,ModInt){
    let mut list = vec![];
    let mut wlist = vec![];
    let mut ans = ModInt(0);
    for &(nxt,w) in &edge[cur] {
        if nxt==p {
            continue;
        }
        let ret = dfs(nxt,cur,&edge);
        list.push(ret);
        wlist.push(ModInt(w as usize));
        ans += ret.3;
    }
    let mut nlist = vec![];
    for i in 0..list.len() {
        let (a,b,c,_) = list[i];
        let w = wlist[i];
        let na = a + ModInt(2)*b*w + w*w*(c+ModInt(1));
        let nb = b + w*(c+ModInt(1));
        let nc = c + ModInt(1);
        nlist.push((na,nb,nc));
        // println!("{} {} {}",na.0,nb.0,nc.0);
    }
    let mut ret = (ModInt(0),ModInt(0),ModInt(0),ans);
    let mut bsum = ModInt(0);
    let mut csum = ModInt(0);
    for i in 0..nlist.len() {
        csum += nlist[i].2;
    }
    for i in 0..nlist.len() {
        let (a,b,c) = nlist[i];
        ret.3 += a*(csum-c);
        ret.3 += ModInt(2)*b*bsum;
        bsum += b;
    }
    for i in 0..nlist.len() {
        let (a,b,c) = nlist[i];
        ret.0 += a;
        ret.1 += b;
        ret.2 += c;
    }
    ret.3 += ret.0;
    // println!("{} {} {} {}",(ret.0).0,(ret.1).0,(ret.2).0,(ret.3).0);
    ret
}

fn run() {
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    solve();
}
0