結果

問題 No.1283 Extra Fee
コンテスト
ユーザー fukafukatani
提出日時 2020-11-06 22:08:17
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 416 ms / 2,000 ms
コード長 3,556 bytes
コンパイル時間 12,723 ms
コンパイル使用メモリ 391,680 KB
実行使用メモリ 85,160 KB
最終ジャッジ日時 2024-11-16 06:41:37
合計ジャッジ時間 19,454 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `i`
  --> src/main.rs:26:9
   |
26 |     for i in 0..m {
   |         ^ help: if this is intentional, prefix it with an underscore: `_i`
   |
   = note: `#[warn(unused_variables)]` on by default

ソースコード

diff # 

#![allow(unused_imports)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;
use std::ops::Bound::*;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn get_idx(i: usize, x: usize, y: usize, w: usize) -> usize {
    i + x * 2 + y * 2 * w
}

fn main() {
    let v = read_vec::<usize>();
    let (n, m) = (v[0], v[1]);
    let mut cost_dict = HashMap::new();
    for i in 0..m {
        let v = read_vec::<i64>();
        let (h, w, c) = (v[0] as usize - 1, v[1] as usize - 1, v[2]);
        cost_dict.insert((h, w), c);
    }

    let mut edges = vec![vec![]; n * n * 2];
    for y in 0..n {
        for x in 0..n {
            let cost;
            let cur0 = get_idx(0, x, y, n);
            let cur1 = get_idx(1, x, y, n);
            if cost_dict.contains_key(&(y, x)) {
                cost = cost_dict[&(y, x)];
            } else {
                cost = 0;
            }
            for (adj_x, adj_y) in get_adjacents(x, y, n, n) {
                let adj0 = get_idx(0, adj_x, adj_y, n);
                let adj1 = get_idx(1, adj_x, adj_y, n);

                edges[adj0].push(Edge {
                    to: cur0,
                    cost: cost + 1,
                });
                edges[adj1].push(Edge {
                    to: cur1,
                    cost: cost + 1,
                });
                edges[adj0].push(Edge { to: cur1, cost: 1 });
            }
        }
    }
    let d = solve(&edges, 0);
    let ans = d[get_idx(1, n - 1, n - 1, n)];
    println!("{}", ans);
}

fn get_adjacents(x: usize, y: usize, w: usize, h: usize) -> Vec<(usize, usize)> {
    let mut adjacents = vec![];
    if x > 0 {
        adjacents.push((x - 1, y));
    }
    if y > 0 {
        adjacents.push((x, y - 1));
    }
    if y < h - 1 {
        adjacents.push((x, y + 1));
    }
    if x < w - 1 {
        adjacents.push((x + 1, y));
    }
    adjacents
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

use std::cmp::Ordering;
use std::collections::BinaryHeap;
const INF: i64 = 100000_00000_00000;

#[derive(PartialEq, Debug)]
struct MinInt {
    value: i64,
}

impl Eq for MinInt {}

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

impl Ord for MinInt {
    fn cmp(&self, other: &MinInt) -> Ordering {
        other.value.cmp(&self.value)
    }
}

fn make_pair(x: i64, y: usize) -> (MinInt, usize) {
    (MinInt { value: x }, y)
}

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

fn solve(edges: &Vec<Vec<Edge>>, start_idx: usize) -> Vec<i64> {
    let num_apexes = edges.len();
    let mut d = vec![INF; num_apexes];
    d[start_idx] = 0;
    let mut que = BinaryHeap::new();
    que.push(make_pair(0, start_idx));

    while let Some((u, v)) = que.pop() {
        if d[v] < u.value {
            continue;
        }
        for e in &edges[v] {
            if d[v] != INF && d[e.to] > d[v] + e.cost {
                d[e.to] = d[v] + e.cost;
                que.push(make_pair(d[e.to], e.to));
            }
        }
    }
    d
}
0