#620832 (Rust) No.1364 [Renaming] Road to Cherry from Zelkova

提出ソース

結果

問題	No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー	ziita
提出日時	2021-02-21 03:33:59
言語	Rust (1.77.0 + proconio)
結果	WA
実行時間	-
コード長	7,655 bytes
コンパイル時間	14,354 ms
コンパイル使用メモリ	377,852 KB
実行使用メモリ	26,180 KB
最終ジャッジ日時	2024-09-19 01:45:45
合計ジャッジ時間	23,902 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,376 KB
testcase_04	AC	1 ms 5,376 KB
testcase_05	AC	1 ms 5,376 KB
testcase_06	AC	1 ms 5,376 KB
testcase_07	AC	1 ms 5,376 KB
testcase_08	AC	6 ms 5,376 KB
testcase_09	AC	3 ms 5,376 KB
testcase_10	AC	4 ms 5,376 KB
testcase_11	AC	5 ms 5,376 KB
testcase_12	AC	5 ms 5,376 KB
testcase_13	AC	59 ms 19,200 KB
testcase_14	AC	146 ms 18,588 KB
testcase_15	AC	78 ms 20,608 KB
testcase_16	AC	62 ms 14,504 KB
testcase_17	AC	34 ms 14,976 KB
testcase_18	AC	97 ms 26,044 KB
testcase_19	AC	95 ms 26,176 KB
testcase_20	AC	101 ms 26,048 KB
testcase_21	AC	102 ms 26,060 KB
testcase_22	AC	103 ms 26,180 KB
testcase_23	AC	22 ms 8,704 KB
testcase_24	AC	18 ms 5,888 KB
testcase_25	AC	43 ms 11,776 KB
testcase_26	AC	70 ms 16,128 KB
testcase_27	AC	55 ms 13,312 KB
testcase_28	AC	32 ms 9,472 KB
testcase_29	AC	51 ms 13,312 KB
testcase_30	AC	33 ms 9,344 KB
testcase_31	AC	26 ms 9,216 KB
testcase_32	AC	43 ms 11,648 KB
testcase_33	AC	66 ms 14,976 KB
testcase_34	AC	64 ms 15,232 KB
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	42 ms 11,264 KB
testcase_38	AC	67 ms 14,464 KB
testcase_39	AC	67 ms 14,464 KB
testcase_40	AC	67 ms 14,336 KB
testcase_41	AC	68 ms 14,592 KB
testcase_42	AC	66 ms 14,336 KB
testcase_43	TLE	-
testcase_44	TLE	-
testcase_45	AC	40 ms 18,816 KB
testcase_46	AC	8 ms 8,536 KB
testcase_47	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#![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;
// 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,m) = read!(usize,usize);
    let uvla = read!(usize,usize,usize,usize;m);
    let mut edge = vec![vec![];n+1];
    for &(u,v,l,a) in &uvla {
        edge[u].push((v,l,a));
    }
    let mut inner = vec![0;n+1];
    for i in 0..n+1 {
        for &(v,_,_) in &edge[i] {
            inner[v] += 1;
        }
    }
    let mut q = VecDeque::new();
    for i in 0..n+1 {
        if inner[i]==0 {
            q.push_back(i);
        }
    }
    let mut list = vec![];
    while let Some(cur) = q.pop_front() {
        list.push(cur);
        for &(e,_,_) in &edge[cur] {
            inner[e] -= 1;
            if inner[e]==0 {
                q.push_back(e);
            }
        }
    }
    if list.len()!=n+1 {
        println!("INF");
        return;
    }
    let mut dp = vec![ModInt(0);n+1];
    let mut pat = vec![ModInt(0);n+1];
    let mut seen = vec![false;n+1];
    pat[0] = ModInt(1);
    seen[0] = true;
    for &cur in &list {
        if !seen[cur] {
            continue;
        }
        let mut outer = vec![ModInt(0);n+1];
        let mut list = vec![];
        for &(v,l,a) in &edge[cur] {
            seen[v] = true;
            dp[v] = dp[v] + dp[cur]*ModInt(a) + ModInt(a)*ModInt(l)*pat[cur];
            outer[v] += ModInt(a);
            list.push(v);
        }
        list.sort();
        list.dedup();
        for &i in &list {
            pat[i] = pat[i] + pat[cur] * outer[i];
        }
    }
    println!("{}",dp[n].0);
}

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

yukicoder

結果

テストケース

ソースコード