結果

問題 No.807 umg tours
ユーザー bqnbqn
提出日時 2022-06-14 00:09:48
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 260 ms / 4,000 ms
コード長 8,221 bytes
コンパイル時間 12,739 ms
コンパイル使用メモリ 378,824 KB
実行使用メモリ 38,524 KB
最終ジャッジ日時 2024-10-01 13:35:51
合計ジャッジ時間 18,052 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 1 ms
5,248 KB
testcase_09 AC 1 ms
5,248 KB
testcase_10 AC 1 ms
5,248 KB
testcase_11 AC 117 ms
22,448 KB
testcase_12 AC 125 ms
25,084 KB
testcase_13 AC 165 ms
29,700 KB
testcase_14 AC 64 ms
15,396 KB
testcase_15 AC 46 ms
13,192 KB
testcase_16 AC 181 ms
30,904 KB
testcase_17 AC 260 ms
38,156 KB
testcase_18 AC 260 ms
38,220 KB
testcase_19 AC 251 ms
38,524 KB
testcase_20 AC 125 ms
31,416 KB
testcase_21 AC 130 ms
32,496 KB
testcase_22 AC 46 ms
15,220 KB
testcase_23 AC 31 ms
12,544 KB
testcase_24 AC 103 ms
36,912 KB
testcase_25 AC 250 ms
37,892 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused macro definition: `input_inner`
  --> src/main.rs:89:14
   |
89 | macro_rules! input_inner {
   |              ^^^^^^^^^^^
   |
   = note: `#[warn(unused_macros)]` on by default

ソースコード

diff # 

#![allow(unused_parens)]
#![allow(unused_imports)]
#![allow(non_upper_case_globals)]
#![allow(non_snake_case)]
#![allow(unused_mut)]
#![allow(unused_variables)]
#![allow(dead_code)]

type Vec2<T> = Vec<Vec<T>>;
type Vec3<T> = Vec<Vec<Vec<T>>>;

#[allow(unused_macros)]
macro_rules! invec {
    ( $ t : ty ) => {{
        let mut s = String::new();
        match std::io::stdin().read_line(&mut s) {
            Ok(0) => Vec::<$t>::new(),
            Ok(n) => s
                .trim()
                .split_whitespace()
                .map(|s| s.parse::<$t>().unwrap())
                .collect::<Vec<$t>>(),
            Err(_) => Vec::<$t>::new(),
        }
    }};
}

#[allow(unused_macros)]
macro_rules! get {
      ($t:ty) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.trim().parse::<$t>().unwrap()
          }
      };
      ($($t:ty),*) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              let mut iter = line.split_whitespace();
              (
                  $(iter.next().unwrap().parse::<$t>().unwrap(),)*
              )
          }
      };
      ($t:ty; $n:expr) => {
          (0..$n).map(|_|
              get!($t)
          ).collect::<Vec<_>>()
      };
      ($($t:ty),*; $n:expr) => {
          (0..$n).map(|_|
              get!($($t),*)
          ).collect::<Vec<_>>()
      };
      ($t:ty ;;) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.split_whitespace()
                  .map(|t| t.parse::<$t>().unwrap())
                  .collect::<Vec<_>>()
          }
      };
      ($t:ty ;; $n:expr) => {
          (0..$n).map(|_| get!($t ;;)).collect::<Vec<_>>()
      };
}

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut 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)*}
    };
    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
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<_>>()
    };

    ($next:expr, [$t:tt]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
#[cfg(debug_assertions)]
macro_rules! mydbg {
    //($arg:expr) => (dbg!($arg))
    //($arg:expr) => (println!("{:?}",$arg));
      ($($a:expr),*) => {
          eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
      }
}
#[cfg(not(debug_assertions))]
macro_rules! mydbg {
    ($($arg:expr),*) => {};
}

macro_rules! echo {
    ($($a:expr),*) => {
          $(println!("{}",$a))*
      }
}

use std::cmp::*;
use std::collections::*;
use std::ops::{Add, Div, Mul, Rem, Sub};

trait SafeRangeContain {
    fn safe_contains(&self, x: i64) -> bool;
}

impl SafeRangeContain for std::ops::Range<usize> {
    fn safe_contains(&self, x: i64) -> bool {
        if x < 0 {
            return false;
        }
        return self.contains(&(x as usize));
    }
}

#[allow(dead_code)]
static INF_I64: i64 = i64::max_value() / 2;
#[allow(dead_code)]
static INF_I32: i32 = i32::max_value() / 2;
#[allow(dead_code)]
static INF_USIZE: usize = usize::max_value() / 2;
#[allow(dead_code)]
static M_O_D: usize = 1000000007;
#[allow(dead_code)]
static PAI: f64 = 3.1415926535897932;

trait IteratorExt: Iterator {
    fn toVec(self) -> Vec<Self::Item>;
}

impl<T: Iterator> IteratorExt for T {
    fn toVec(self) -> Vec<Self::Item> {
        self.collect()
    }
}

trait CharExt {
    fn toNum(&self) -> usize;
    fn toAlphabetIndex(&self) -> usize;
    fn toNumIndex(&self) -> usize;
}
impl CharExt for char {
    fn toNum(&self) -> usize {
        return *self as usize;
    }
    fn toAlphabetIndex(&self) -> usize {
        return self.toNum() - 'a' as usize;
    }
    fn toNumIndex(&self) -> usize {
        return self.toNum() - '0' as usize;
    }
}

trait VectorExt {
    fn joinToString(&self, s: &str) -> String;
}
impl<T: ToString> VectorExt for Vec<T> {
    fn joinToString(&self, s: &str) -> String {
        return self
            .iter()
            .map(|x| x.to_string())
            .collect::<Vec<_>>()
            .join(s);
    }
}

trait StringExt {
    fn get_reverse(&self) -> String;
}
impl StringExt for String {
    fn get_reverse(&self) -> String {
        self.chars().rev().collect::<String>()
    }
}

trait UsizeExt {
    fn pow(&self, n: usize) -> usize;
}
impl UsizeExt for usize {
    fn pow(&self, n: usize) -> usize {
        return ((*self as u64).pow(n as u32)) as usize;
    }
}

pub struct Dikstra {
    dist: Vec<(u64, usize)>,
    start: usize,
    N: usize,
    //cnt: Vec<mint>,
}
impl Dikstra {
    pub fn new(N: usize, g: &Vec<Vec<(u64, usize)>>, start: usize) -> Self {
        //cnt[start] = mint::new(1);
        let mut d = Dikstra {
            dist: vec![(u64::max_value() / 2, 0); g.len()],
            start: start,
            N, //cnt: cnt,
        };
        d.calc(g);
        return d;
    }
    fn calc(&mut self, g: &Vec<Vec<(u64, usize)>>) {
        let mut kouho = std::collections::BinaryHeap::new();
        self.dist[self.start] = (0, self.start);
        kouho.push(Reverse((0, self.start)));
        let N = self.N;
        while let Some(Reverse((d, v))) = kouho.pop() {
            //if d > self.dist[v].0 {
            if d != self.dist[v].0 {
                continue;
            }

            if v >= N {
                for &(cost, u) in g[v].iter() {
                    let d = d + cost;
                    if self.dist[u].0 > d {
                        self.dist[u] = (d, v);
                        kouho.push(Reverse((d, u)));
                    }
                }
            } else {
                for &(cost, u) in g[v].iter() {
                    let d = d;
                    if self.dist[u + N].0 > d {
                        self.dist[u + N] = (d, v);
                        kouho.push(Reverse((d, u + N)));
                    }
                    let d = d + cost;
                    if self.dist[u].0 > d {
                        self.dist[u] = (d, v);
                        kouho.push(Reverse((d, u)));
                    }
                }
            }
        }
    }
    pub fn dist_to(&mut self, x: usize) -> (u64, usize) {
        return self.dist[x];
    }
}

fn main() {
    solve();
}

fn solve() {
    let mut ans: u64 = 0;
    let (N, M) = get!(usize, usize);
    let mut g = vec![vec![]; N * 2];
    for _ in 0..M {
        let (u, v, c) = get!(usize, usize, u64);
        let u = u - 1;
        let v = v - 1;
        g[u].push((c, v));
        g[v].push((c, u));
        g[u + N].push((c, v + N));
        g[v + N].push((c, u + N));
    }

    let mut dik = Dikstra::new(N, &g, 0);
    mydbg!(dik.dist);
    let mut ans = vec![];
    for i in 0..N {
        let d = dik.dist_to(i + N).0;
        let d2 = dik.dist_to(i).0;
        mydbg!(i, d, d2);
        ans.push(min(d, d2) + d2);
    }

    echo!(ans.joinToString("\n"));
}
0