Shortest Routes I

warning: unused imports: `max`, `min`
 --> input/code.rs:1:16
  |
1 | use std::cmp::{max, min, Reverse};
  |                ^^^  ^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused imports: `HashMap`, `HashSet`
 --> input/code.rs:2:36
  |
2 | use std::collections::{BinaryHeap, HashMap, HashSet};
  |                                    ^^^^^^^  ^^^^^^^

warning: 2 warnings emitted

use std::cmp::{max, min, Reverse};
use std::collections::{BinaryHeap, HashMap, HashSet};
use std::io::{self, Read};

macro_rules! input {
    ($it: expr) => {
        $it.next().unwrap().parse().unwrap()
    };
    ($it: expr, $T: ty) => {
        $it.next().unwrap().parse::<$T>().unwrap()
    };
}
/*
mod classes;
mod homework;

fn main() {
    // println!("{}", "-".repeat(20));
    // classes::c13::task2();
    homework::hw5::task1();
    // println!("{}", "-".repeat(20));
}
// */




fn main() {
    let mut buf = String::new();
    io::stdin().read_to_string(&mut buf).unwrap();

    let mut it = buf.split_whitespace();

    let (n, m): (usize, usize) = (input!(it), input!(it));

    let mut g: Vec<Vec<(usize, i64)>> = vec![vec![]; n + 1];

    for _ in 1..m+1 {
        let (v, u, c): (usize, usize, i64) = (input!(it), input!(it), input!(it));
        g[v].push((u, c));
    }

    let mut dist = vec![i64::MAX; n + 1];
    dist[1] = 0;
    let mut pq = BinaryHeap::new();
    pq.push((Reverse(0), 1)); // (distance, city)

    while let Some((Reverse(d), u)) = pq.pop() {
        // Explore neighbors if path more promising than current one
        if d <= dist[u] {
            for &(v, w) in &g[u] {
                if dist[u] + w < dist[v] {
                    dist[v] = dist[u] + w;
                    pq.push((Reverse(dist[v]), v));
                }
            }
        }
    }

    for i in 1..n+1{
        print!("{} ", dist[i])
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED