結果

問題 No.1320 Two Type Min Cost Cycle
ユーザー cympfhcympfh
提出日時 2020-12-24 13:39:50
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 1,079 ms / 2,000 ms
コード長 5,772 bytes
コンパイル時間 14,028 ms
コンパイル使用メモリ 391,068 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-09-21 16:54:36
合計ジャッジ時間 22,952 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 1 ms
6,812 KB
testcase_03 AC 1 ms
6,812 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 3 ms
6,940 KB
testcase_08 AC 3 ms
6,944 KB
testcase_09 AC 173 ms
6,940 KB
testcase_10 AC 5 ms
6,944 KB
testcase_11 AC 128 ms
6,944 KB
testcase_12 AC 13 ms
6,944 KB
testcase_13 AC 55 ms
6,944 KB
testcase_14 AC 1 ms
6,944 KB
testcase_15 AC 5 ms
6,940 KB
testcase_16 AC 17 ms
6,940 KB
testcase_17 AC 2 ms
6,940 KB
testcase_18 AC 2 ms
6,944 KB
testcase_19 AC 69 ms
6,944 KB
testcase_20 AC 1 ms
6,944 KB
testcase_21 AC 167 ms
6,944 KB
testcase_22 AC 1 ms
6,944 KB
testcase_23 AC 1 ms
6,940 KB
testcase_24 AC 1 ms
6,944 KB
testcase_25 AC 1 ms
6,944 KB
testcase_26 AC 1 ms
6,944 KB
testcase_27 AC 1 ms
6,940 KB
testcase_28 AC 2 ms
6,940 KB
testcase_29 AC 68 ms
6,940 KB
testcase_30 AC 1 ms
6,940 KB
testcase_31 AC 12 ms
6,940 KB
testcase_32 AC 1 ms
6,940 KB
testcase_33 AC 89 ms
6,940 KB
testcase_34 AC 40 ms
6,948 KB
testcase_35 AC 12 ms
6,944 KB
testcase_36 AC 6 ms
6,944 KB
testcase_37 AC 2 ms
6,944 KB
testcase_38 AC 24 ms
6,944 KB
testcase_39 AC 4 ms
6,940 KB
testcase_40 AC 1 ms
6,940 KB
testcase_41 AC 1 ms
6,944 KB
testcase_42 AC 1 ms
6,944 KB
testcase_43 AC 7 ms
6,940 KB
testcase_44 AC 4 ms
6,940 KB
testcase_45 AC 159 ms
6,944 KB
testcase_46 AC 9 ms
6,944 KB
testcase_47 AC 35 ms
6,944 KB
testcase_48 AC 88 ms
6,940 KB
testcase_49 AC 7 ms
6,940 KB
testcase_50 AC 1 ms
6,944 KB
testcase_51 AC 1 ms
6,940 KB
testcase_52 AC 16 ms
6,940 KB
testcase_53 AC 8 ms
6,944 KB
testcase_54 AC 732 ms
6,944 KB
testcase_55 AC 731 ms
6,940 KB
testcase_56 AC 727 ms
6,944 KB
testcase_57 AC 1,079 ms
6,940 KB
testcase_58 AC 1,078 ms
6,940 KB
testcase_59 AC 1,075 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports, unused_macros, dead_code)]
use std::cmp::*;
use std::collections::*;

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! trace {
    ($x:expr) => {
        #[cfg(debug_assertions)]
        eprintln!(">>> {} = {:?}", stringify!($x), $x)
    };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

fn main() {
    let mut sc = Scanner::new();
    let ty: usize = sc.cin();
    let n: usize = sc.cin();
    let m: usize = sc.cin();
    let mut g = vec![vec![]; n];
    let mut e = vec![];

    if ty == 0 {
        for _ in 0..m {
            let u = sc.cin::<usize>() - 1;
            let v = sc.cin::<usize>() - 1;
            let w: i128 = sc.cin();
            g[u].push((v, w));
            g[v].push((u, w));
            e.push((u, v, w));
        }
    } else {
        for _ in 0..m {
            let u = sc.cin::<usize>() - 1;
            let v = sc.cin::<usize>() - 1;
            let w: i128 = sc.cin();
            g[u].push((v, w));
            e.push((u, v, w));
        }
    }

    match solve(n, &g, &e) {
        Some(w) => put!(w),
        _ => put!(-1),
    }
}

fn solve(n: usize, g: &Vec<Vec<(usize, i128)>>, e: &Vec<(usize, usize, i128)>) -> Option<i128> {
    use Hyper::*;
    let mut ans = Inf;
    for &(u0, v0, w0) in e.iter() {
        // u0 -> v0 -> ... -> u0
        let mut memo = vec![Inf; n];
        memo[v0] = Real(0);
        let mut q = BinaryHeap::new();
        q.push((Reverse(0), v0));
        while let Some((Reverse(cost), u)) = q.pop() {
            for &(v, w) in g[u].iter() {
                if (u, v) == (u0, v0) || (u, v) == (v0, u0) {
                    continue;
                }
                let c = cost + w;
                if memo[v] > Real(c) {
                    memo[v] = Real(c);
                    q.push((Reverse(c), v));
                }
            }
        }
        ans = min!(ans, memo[u0] + w0);
    }
    ans.ok()
}

// @algebra/hyper
// @algebra/group
pub trait Group:
    std::ops::Add<Output = Self>
    + std::ops::Sub<Output = Self>
    + std::ops::Neg<Output = Self>
    + std::iter::Sum
{
    fn zero() -> Self;
}
macro_rules! define_group {
    ($t:ty, $x:expr) => {
        impl Group for $t {
            fn zero() -> Self {
                $x
            }
        }
    };
}
define_group!(i32, 0);
define_group!(i64, 0);
define_group!(i128, 0);
define_group!(f32, 0.0);
define_group!(f64, 0.0);

#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
pub enum Hyper<X> {
    NegInf,
    Real(X),
    Inf,
}
use Hyper::{Inf, NegInf, Real};
impl<X> Hyper<X> {
    pub fn unwrap(self) -> X {
        if let Hyper::Real(x) = self {
            x
        } else {
            panic!()
        }
    }
    pub fn ok(self) -> Option<X> {
        if let Hyper::Real(x) = self {
            Some(x)
        } else {
            None
        }
    }
}
impl<X: Group> std::ops::Add for Hyper<X> {
    type Output = Self;
    fn add(self, rhs: Hyper<X>) -> Hyper<X> {
        match (self, rhs) {
            (Real(x), Real(y)) => Real(x + y),
            (Inf, _) => Inf,
            (_, Inf) => Inf,
            _ => NegInf,
        }
    }
}
impl<X: Group> std::ops::Sub for Hyper<X> {
    type Output = Self;
    fn sub(self, rhs: Hyper<X>) -> Hyper<X> {
        self + (-rhs)
    }
}
impl<X: Group> std::ops::Neg for Hyper<X> {
    type Output = Self;
    fn neg(self) -> Hyper<X> {
        match self {
            Inf => NegInf,
            NegInf => Inf,
            Real(x) => Real(-x),
        }
    }
}
impl<X: Group> std::iter::Sum for Hyper<X> {
    fn sum<I: Iterator<Item = Self>>(iter: I) -> Self {
        iter.fold(Hyper::zero(), std::ops::Add::add)
    }
}
impl<X: Group> Group for Hyper<X> {
    fn zero() -> Self {
        Hyper::Real(X::zero())
    }
}
impl<X: Group> std::ops::Add<X> for Hyper<X> {
    type Output = Self;
    fn add(self, other: X) -> Self {
        match self {
            Inf => Inf,
            NegInf => NegInf,
            Real(x) => Real(x + other),
        }
    }
}

use std::collections::VecDeque;
use std::io::{self, Write};
use std::str::FromStr;

struct Scanner {
    stdin: io::Stdin,
    buffer: VecDeque<String>,
}
impl Scanner {
    fn new() -> Self {
        Scanner {
            stdin: io::stdin(),
            buffer: VecDeque::new(),
        }
    }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.is_empty() {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> {
        self.cin::<String>().chars().collect()
    }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.cin()).collect()
    }
}
fn flush() {
    std::io::stdout().flush().unwrap();
}
0