結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー nebocconebocco
提出日時 2021-02-17 20:15:13
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 222 ms / 2,500 ms
コード長 13,012 bytes
コンパイル時間 13,200 ms
コンパイル使用メモリ 399,392 KB
実行使用メモリ 67,660 KB
最終ジャッジ日時 2024-09-14 05:46:20
合計ジャッジ時間 22,075 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 8 ms
6,528 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 AC 6 ms
5,376 KB
testcase_11 AC 6 ms
5,632 KB
testcase_12 AC 6 ms
5,376 KB
testcase_13 AC 122 ms
47,488 KB
testcase_14 AC 132 ms
48,196 KB
testcase_15 AC 144 ms
52,080 KB
testcase_16 AC 90 ms
36,456 KB
testcase_17 AC 66 ms
34,480 KB
testcase_18 AC 208 ms
67,568 KB
testcase_19 AC 222 ms
67,660 KB
testcase_20 AC 215 ms
67,544 KB
testcase_21 AC 222 ms
67,520 KB
testcase_22 AC 219 ms
67,576 KB
testcase_23 AC 36 ms
21,504 KB
testcase_24 AC 17 ms
12,672 KB
testcase_25 AC 84 ms
32,708 KB
testcase_26 AC 128 ms
45,824 KB
testcase_27 AC 76 ms
36,224 KB
testcase_28 AC 53 ms
24,984 KB
testcase_29 AC 66 ms
35,328 KB
testcase_30 AC 53 ms
25,268 KB
testcase_31 AC 41 ms
23,936 KB
testcase_32 AC 48 ms
30,976 KB
testcase_33 AC 110 ms
42,112 KB
testcase_34 AC 132 ms
44,800 KB
testcase_35 AC 168 ms
56,544 KB
testcase_36 AC 145 ms
52,480 KB
testcase_37 AC 41 ms
27,956 KB
testcase_38 AC 55 ms
36,776 KB
testcase_39 AC 56 ms
37,144 KB
testcase_40 AC 56 ms
37,248 KB
testcase_41 AC 55 ms
37,184 KB
testcase_42 AC 54 ms
36,736 KB
testcase_43 AC 97 ms
62,208 KB
testcase_44 AC 55 ms
45,728 KB
testcase_45 AC 84 ms
60,672 KB
testcase_46 AC 11 ms
13,056 KB
testcase_47 AC 1 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

fn main() {
	let mut io = IO::new();
    input!{ from io,
		n: usize, m: usize,
		ed:[(usize, usize, i64, i64); m]
    }
	let mut g = DirectedGraph::new(n+1);
	for &(u, v, l, _) in &ed {
		g.add_edge(u, v, l);
	}
	const MOD: i64 = 1_000_000_007;
	let mut g = vec![Vec::new(); n+1];
	let mut gr = vec![Vec::new(); n+1];
	let mut out = vec![0; n+1];
	let mut rout = vec![0; n+1];
	for &(u, v, l, a) in &ed {
		g[u].push((v, l, a));
		out[v] += 1;
		gr[v].push((u, l, a));
		rout[u] += 1;
	}
	let mut que: Vec<usize> = Vec::new();
	let mut fse = vec![false; n+1];
	fse[0] = true;
	que.push(0);
	while let Some(v) = que.pop() {
		for &(u, _, _) in &g[v] {
			if !fse[u] {
				fse[u] = true;
				que.push(u);
			}
		}
	}

	let mut rse = vec![false; n+1];
	rse[n] = true;
	que.push(n);
	while let Some(v) = que.pop() {
		for &(u, _, _) in &gr[v] {
			if !rse[u] {
				rse[u] = true;
				que.push(u);
			}
		}
	}

	(0..n).for_each(|i| fse[i] &= rse[i]);

	let mut fwd = vec![0; n+1];
	fwd[0] = 1;
	que = (0..=n).filter(|&i| out[i] == 0).collect();
	while let Some(v) = que.pop() {
		for &(u, _l, a) in &g[v] {
			fwd[u] = (fwd[u] + fwd[v] * a) % MOD;
			out[u] -= 1;
			if out[u] == 0 {
				que.push(u);
			}
		}
	}
	if (0..n).any(|i| fse[i] && out[i] > 0) {
		io.println("INF");
		return;
	}
	let mut rev = vec![0; n+1];
	rev[n] = 1;
	que = (0..=n).filter(|&i| rout[i] == 0).collect();
	while let Some(v) = que.pop() {
		for &(u, _l, a) in &gr[v] {
			rev[u] = (rev[u] + rev[v] * a) % MOD;
			rout[u] -= 1;
			if rout[u] == 0 {
				que.push(u);
			}
		}
	}
	let mut ans = 0;
	for &(u, v, l, a) in &ed {
		ans = (ans + fwd[u] * rev[v] % MOD * l % MOD * a) % MOD;
	}
    io.println(ans);
}

pub fn detect_cycle<C: Element, G: Graph<C>>(graph: &G) -> Option<Vec<usize>> {
    let n = graph.size();
    let mut seen = vec![0; n];
    let mut from = vec![n; n];
    let mut c = 0;
    let mut st = Vec::new();
    for i in 0..graph.size() {
        if seen[i] > 0 { continue; }
        c += 1;
        seen[i] = c;
        st.push(i);
        while let Some(v0) = st.pop() {
            for u in graph.edges_from(v0) {
                if seen[u.to] == c {
                    let mut res = Vec::new();
                    let mut v = v0;
                    res.push(v);
                    while v != u.to {
                        v = from[v];
                        res.push(v);
                    }
                    res.reverse();
                    return Some(res);
                } else if seen[u.to] > 0 {
                    continue;
                }
                seen[u.to] = c;
                from[u.to] = v0;
                st.push(u.to);
            }
        }
    }
    None
}

// ------------ Graph impl start ------------

pub trait Cost:
    Element
    + Clone + Copy + std::fmt::Display
    + Eq + Ord
    + Zero + One
    + Add<Output = Self> + AddAssign
    + Sub<Output = Self>
    + Neg<Output = Self>
{
    const MAX: Self;
}

#[derive(Copy, Clone)]
pub struct Edge<C = Void> {
    // pub from: usize,
    pub to: usize,
    pub cost: C,
    pub id: usize
}

pub struct UndirectedGraph<C>(pub Vec<Vec<Edge<C>>>, pub usize);
pub struct DirectedGraph<C>{
    pub forward: Vec<Vec<Edge<C>>>,
    pub backward: Vec<Vec<Edge<C>>>,
    pub count: usize,
}

pub trait Graph<C: Element> {
    fn new(size: usize) -> Self;
    fn size(&self) -> usize;
    fn add_edge(&mut self, u: usize, v: usize, cost: C);
    fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>>;
}

impl<C: Element> Graph<C> for UndirectedGraph<C> {
    fn new(size: usize) -> Self {
        Self(vec![Vec::<Edge<C>>::new(); size], 0)
    }

    fn size(&self) -> usize {
        self.0.len()
    }

    fn add_edge(&mut self, u: usize, v: usize, cost: C) {
        self.0[u].push(Edge{ to: v, cost: cost.clone(), id: self.1 });
        self.0[v].push(Edge{ to: u, cost: cost.clone(), id: self.1 });
        self.1 += 1;
    }

    fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>> {
        self.0[v].iter()
    }
}

impl<C: Element> Graph<C> for DirectedGraph<C> {
    fn new(size: usize) -> Self {
        Self {
            forward: vec![Vec::<Edge<C>>::new(); size],
            backward: vec![Vec::<Edge<C>>::new(); size],
            count: 0
        }
    }

    fn size(&self) -> usize {
        self.forward.len()
    }

    fn add_edge(&mut self, u: usize, v: usize, cost: C) {
        self.forward[u].push(Edge{ to: v, cost: cost.clone(), id: self.count });
        self.backward[v].push(Edge{ to: u, cost: cost.clone(), id: self.count });
        self.count += 1;
    }

    fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>> {
        self.forward[v].iter()
    }
}

impl<C: Element> DirectedGraph<C> {
    pub fn edges_to(&self, u: usize) -> std::slice::Iter<Edge<C>> {
        self.backward[u].iter()
    }

    pub fn reverse(&self) -> Self {
        Self {
            forward: self.backward.clone(),
            backward: self.forward.clone(),
            count: self.count,
        }
    }
}

macro_rules! impl_cost {
    ($($T:ident,)*) => {
        $(
            impl Cost for $T { const MAX: Self = std::$T::MAX; }
        )*
    };
}

impl_cost! {
    i8, i16, i32, i64, i128, isize,
}

#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
pub struct Void();

impl std::fmt::Display for Void {
    fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
        write!(f, "")
    }
}

impl Zero for Void {
    fn zero() -> Self { Void() }
    fn is_zero(&self) -> bool { true }
}

impl One for Void {
    fn one() -> Self { Void() }
    fn is_one(&self) -> bool { true }
}

impl Add for Void {
    type Output = Self;
    fn add(self, _: Self) -> Self { Void() }
}

impl AddAssign for Void {
    fn add_assign(&mut self, _: Self) {}
}

impl Sub for Void {
    type Output = Self;
    fn sub(self, _: Self) -> Self { Void() }
}

impl Neg for Void {
    type Output = Self;
    fn neg(self) -> Self { Void() }
}

impl Cost for Void { const MAX: Self = Void(); }

// ------------ Graph impl end ------------

// ------------ algebraic traits start ------------
use std::marker::Sized;
use std::ops::*;

/// 元
pub trait Element: Sized + Clone + PartialEq {}
impl<T: Sized + Clone + PartialEq> Element for T {}

/// 結合性
pub trait Associative: Magma {}

/// マグマ
pub trait Magma: Element + Add<Output=Self> {}
impl<T: Element + Add<Output=Self>> Magma for T {}

/// 半群
pub trait SemiGroup: Magma + Associative {}
impl<T: Magma + Associative> SemiGroup for T {}

/// モノイド
pub trait Monoid: SemiGroup + Zero {}
impl<T: SemiGroup + Zero> Monoid for T {}

pub trait ComMonoid: Monoid + AddAssign {}
impl<T: Monoid + AddAssign> ComMonoid for T {}

/// 群
pub trait Group: Monoid + Neg<Output=Self> {}
impl<T: Monoid + Neg<Output=Self>> Group for T {}

pub trait ComGroup: Group + ComMonoid {}
impl<T: Group + ComMonoid> ComGroup for T {}

/// 半環
pub trait SemiRing: ComMonoid + Mul<Output=Self> + One {}
impl<T: ComMonoid + Mul<Output=Self> + One> SemiRing for T {}

/// 環
pub trait Ring: ComGroup + SemiRing {}
impl<T: ComGroup + SemiRing> Ring for T {}

pub trait ComRing: Ring + MulAssign {}
impl<T: Ring + MulAssign> ComRing for T {}

/// 体
pub trait Field: ComRing + Div<Output=Self> + DivAssign {}
impl<T: ComRing + Div<Output=Self> + DivAssign> Field for T {}

/// 加法単元
pub trait Zero: Element {
    fn zero() -> Self;
    fn is_zero(&self) -> bool {
        *self == Self::zero()
    }
}

/// 乗法単元
pub trait One: Element {
    fn one() -> Self;
    fn is_one(&self) -> bool {
        *self == Self::one()
    }
}

macro_rules! impl_integer {
    ($($T:ty,)*) => {
        $(
            impl Associative for $T {}

            impl Zero for $T {
                fn zero() -> Self { 0 }
                fn is_zero(&self) -> bool { *self == 0 }
            }

            impl<'a> Zero for &'a $T {
                fn zero() -> Self { &0 }
                fn is_zero(&self) -> bool { *self == &0 }
            }

            impl One for $T {
                fn one() -> Self { 1 }
                fn is_one(&self) -> bool { *self == 1 }
            }

            impl<'a> One for &'a $T {
                fn one() -> Self { &1 }
                fn is_one(&self) -> bool { *self == &1 }
            }
        )*
    };
}

impl_integer! {
    i8, i16, i32, i64, i128, isize,
    u8, u16, u32, u64, u128, usize,
}
// ------------ algebraic traits end ------------

// ------------ io module start ------------
use std::io::{stdout, BufWriter, Read, StdoutLock, Write};

pub struct IO {
	iter: std::str::SplitAsciiWhitespace<'static>,
	buf: BufWriter<StdoutLock<'static>>,
}

impl IO {
	pub fn new() -> Self {
		let mut input = String::new();
		std::io::stdin().read_to_string(&mut input).unwrap();
		let input = Box::leak(input.into_boxed_str());
		let out = Box::new(stdout());
		IO {
			iter: input.split_ascii_whitespace(),
			buf: BufWriter::new(Box::leak(out).lock()),
		}
	}
	fn scan_str(&mut self) -> &'static str {
		self.iter.next().unwrap()
	}
	pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output {
		<T as Scan>::scan(self)
	}
	pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> {
		(0..n).map(|_| self.scan::<T>()).collect()
	}
	pub fn print<T: Print>(&mut self, x: T) {
		<T as Print>::print(self, x);
	}
	pub fn println<T: Print>(&mut self, x: T) {
		self.print(x);
		self.print("\n");
	}
	pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) {
		if let Some(v) = iter.next() {
			self.print(v);
			for v in iter {
				self.print(delim);
				self.print(v);
			}
		}
		self.print("\n");
	}
	pub fn flush(&mut self) {
		self.buf.flush().unwrap();
	}
}

impl Default for IO {
	fn default() -> Self {
		Self::new()
	}
}

pub trait Scan {
	type Output;
	fn scan(io: &mut IO) -> Self::Output;
}

macro_rules! impl_scan {
	($($t:tt),*) => {
		$(
			impl Scan for $t {
				type Output = Self;
				fn scan(s: &mut IO) -> Self::Output {
					s.scan_str().parse().unwrap()
				}
			}
		)*
	};
}

impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String);

pub enum Bytes {}
impl Scan for Bytes {
	type Output = &'static [u8];
	fn scan(s: &mut IO) -> Self::Output {
		s.scan_str().as_bytes()
	}
}

pub enum Chars {}
impl Scan for Chars {
	type Output = Vec<char>;
	fn scan(s: &mut IO) -> Self::Output {
		s.scan_str().chars().collect()
	}
}

pub enum Usize1 {}
impl Scan for Usize1 {
	type Output = usize;
	fn scan(s: &mut IO) -> Self::Output {
		s.scan::<usize>().wrapping_sub(1)
	}
}

impl<T: Scan, U: Scan> Scan for (T, U) {
	type Output = (T::Output, U::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s))
	}
}

impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) {
	type Output = (T::Output, U::Output, V::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s), V::scan(s))
	}
}

impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) {
	type Output = (T::Output, U::Output, V::Output, W::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s), V::scan(s), W::scan(s))
	}
}

pub trait Print {
	fn print(w: &mut IO, x: Self);
}

macro_rules! impl_print_int {
	($($t:ty),*) => {
		$(
			impl Print for $t {
				fn print(w: &mut IO, x: Self) {
					w.buf.write_all(x.to_string().as_bytes()).unwrap();
				}
			}
		)*
	};
}

impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize);

impl Print for u8 {
	fn print(w: &mut IO, x: Self) {
		w.buf.write_all(&[x]).unwrap();
	}
}

impl Print for &[u8] {
	fn print(w: &mut IO, x: Self) {
		w.buf.write_all(x).unwrap();
	}
}

impl Print for &str {
	fn print(w: &mut IO, x: Self) {
		w.print(x.as_bytes());
	}
}

impl Print for String {
	fn print(w: &mut IO, x: Self) {
		w.print(x.as_bytes());
	}
}

impl<T: Print, U: Print> Print for (T, U) {
	fn print(w: &mut IO, (x, y): Self) {
		w.print(x);
		w.print(" ");
		w.print(y);
	}
}

impl<T: Print, U: Print, V: Print> Print for (T, U, V) {
	fn print(w: &mut IO, (x, y, z): Self) {
		w.print(x);
		w.print(" ");
		w.print(y);
		w.print(" ");
		w.print(z);
	}
}

mod neboccoio_macro {
	#[macro_export]
	macro_rules! input {
		(@start $io:tt @read @rest) => {};

		(@start $io:tt @read @rest, $($rest: tt)*) => {
			input!(@start $io @read @rest $($rest)*)
		};

		(@start $io:tt @read @rest mut $($rest:tt)*) => {
			input!(@start $io @read @mut [mut] @rest $($rest)*)
		};

		(@start $io:tt @read @rest $($rest:tt)*) => {
			input!(@start $io @read @mut [] @rest $($rest)*)
		};

		(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:tt] $($rest:tt)*) => {
			let $($mut)* $var = $io.scan_vec::<$kind>($len);
			input!(@start $io @read @rest $($rest)*)
		};

		(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => {
			let $($mut)* $var = $io.scan::<$kind>();
			input!(@start $io @read @rest $($rest)*)
		};

		(from $io:tt $($rest:tt)*) => {
			input!(@start $io @read @rest $($rest)*)
		};
	}
}

// ------------ io module end ------------
0