結果

問題 No.160 最短経路のうち辞書順最小
ユーザー negnatnegnat
提出日時 2022-03-01 15:21:47
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 4,311 bytes
コンパイル時間 13,551 ms
コンパイル使用メモリ 379,072 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-07 21:26:21
合計ジャッジ時間 11,865 ms
ジャッジサーバーID
（参考情報） 		judge1 / 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 0 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 2 ms
5,376 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 1 ms
5,376 KB
testcase_20 AC 1 ms
5,376 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 1 ms
5,376 KB
testcase_28 WA -
testcase_29 AC 1 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

use std::collections::binary_heap::BinaryHeap;
use std::cmp::{min, Ordering, Reverse};

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

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

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

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

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

#[derive(Debug, Clone, Copy)]
struct Edge {
    to: usize,
    cost: i32,
}

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
struct Node {
    id: usize,
    cost: i32,
    prev: Option<usize>,
}

#[derive(Debug)]
struct Graph {
    nodes: Vec<Node>,
    edges: Vec<Vec<Edge>>,
}

impl Graph {
    fn new(n_nodes: usize) -> Self {
        let mut nodes = Vec::with_capacity(n_nodes);
        let edges = vec![Vec::new(); n_nodes];

        for i in 0..n_nodes {
            nodes.push(Node { id: i, cost: i32::MAX, prev: None })
        }

        Self {
            nodes,
            edges,
        }
    }

    fn add_edge(&mut self, from: usize, to: usize, cost: i32) {
        self.edges[from].push(Edge { to, cost });
        self.edges[to].push(Edge { to: from, cost });
    }
}

impl PartialOrd<Self> for Node {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        self.cost.partial_cmp(&other.cost)
    }
}

impl Ord for Node {
    fn cmp(&self, other: &Self) -> Ordering {
        self.cost.cmp(&other.cost)
    }
}

fn dijkstra(graph: &mut Graph, from: usize, to: usize) {
    let mut heap = BinaryHeap::new();
    let mut visited = vec![false; graph.nodes.len()];

    graph.nodes[from].cost = 0;
    heap.push(Reverse(graph.nodes[from]));

    while let Some(Reverse(node)) = heap.pop() {
        if visited[node.id] {
            continue;
        }

        visited[node.id] = true;

        if node.id == to {
            break;
        }

        for e in &graph.edges[node.id] {
            if node.cost + e.cost < graph.nodes[e.to].cost {
                graph.nodes[e.to].cost = node.cost + e.cost;
                graph.nodes[e.to].prev = Some(node.id);

                heap.push(Reverse(graph.nodes[e.to]));
            }

            if node.cost + e.cost == graph.nodes[e.to].cost {
                if let Some(prev_node_id) = graph.nodes[e.to].prev {
                    graph.nodes[e.to].prev = Some(min(prev_node_id, node.id));
                }
            }
        }
    }
}

fn backtrace_path(graph: &Graph, to: usize) -> Vec<&Node> {
    let mut path = Vec::new();
    let mut node_id = to;

    loop {
        let node = &graph.nodes[node_id];
        path.push(node);

        if let Some(prev_node_id) = node.prev {
            node_id = prev_node_id;
        } else {
            break;
        }
    }

    path.reverse();

    path
}

fn main() {
    input! {
        n: usize,
        m: usize,
        s: usize,
        g: usize,
        edges: [(usize, usize, i32); m]
    }

    let mut graph = Graph::new(n);

    for (from, to, cost) in edges {
        graph.add_edge(from, to, cost);
    }

    dijkstra(&mut graph, s, g);
    let path = backtrace_path(&graph, g);

    let answer = path.iter().map(|p| p.id.to_string()).collect::<Vec<_>>().join(" ");

    println!("{}", answer);
}
0