結果

問題 No.2565 はじめてのおつかい
ユーザー Rusty
提出日時 2023-12-02 16:36:25
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 113 ms / 2,000 ms
コード長 5,582 bytes
コンパイル時間 14,922 ms
コンパイル使用メモリ 381,780 KB
実行使用メモリ 24,440 KB
最終ジャッジ日時 2024-09-26 20:30:31
合計ジャッジ時間 16,486 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 50
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: function `Dijkstra` should have a snake case name
   --> src/main.rs:102:8
    |
102 | pub fn Dijkstra(
    |        ^^^^^^^^ help: convert the identifier to snake case: `dijkstra`
    |
note: the lint level is defined here
   --> src/main.rs:4:9
    |
4   | #![warn(non_snake_case)]
    |         ^^^^^^^^^^^^^^

ソースコード

diff #
プレゼンテーションモードにする

#![allow(unused_imports)]
#![allow(dead_code)]
#![allow(unused_variables)]
#![warn(non_snake_case)]
//use itertools::Itertools;
use std::cmp::{max, min, Reverse};
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
use std::f64::consts::PI;
use std::io::prelude::*;
use std::io::{stdin, stdout, BufWriter, Write};
use std::time::Instant;
/*
use rand::distributions::{Distribution, Uniform};
use rand_chacha::{rand_core::SeedableRng, ChaCha8Rng};
use core::ops::{Add,Sub,Mul,Div};
use itertools::Itertools;
*/
const M1: i64 = 1000_000_007;
const M2: i64 = 998244353;
fn main() {
//let mut out: BufWriter<std::io::StdoutLock<'_>> = BufWriter::new(stdout().lock());
input! {
n: usize,
m: usize,
uv: [(usize,usize);m]
}
let mut edge = vec![];
for i in 0..m {
edge.push((uv[i].0, uv[i].1, 1));
}
let mut ans1: i64 = 0;
let mut ans2: i64 = 0;
let (dist1, set) = Dijkstra(1, n, m, &edge);
let (distn1, set) = Dijkstra(n - 1, n, m, &edge);
let (distn, set) = Dijkstra(n, n, m, &edge);
if dist1[n - 1] == usize::MAX {
ans1 += 1000_000_000_000;
} else {
ans1 += dist1[n - 1] as i64;
}
if distn1[n] == usize::MAX {
ans1 += 1000_000_000_000;
} else {
ans1 += distn1[n] as i64;
}
if distn[1] == usize::MAX {
ans1 += 1000_000_000_000;
} else {
ans1 += distn[1] as i64;
}
if dist1[n] == usize::MAX {
ans2 += 1000_000_000_000;
} else {
ans2 += dist1[n] as i64;
}
if distn[n - 1] == usize::MAX {
ans2 += 1000_000_000_000;
} else {
ans2 += distn[n - 1] as i64;
}
if distn1[1] == usize::MAX {
ans2 += 1000_000_000_000;
} else {
ans2 += distn1[1] as i64;
}
if ans1 > 1000_000_000_000 && ans2 > 1000_000_000_000 {
println!("{}", -1);
} else {
println!("{}", min(ans1, ans2));
}
//write!(out,"{}\n",ans).unwrap();
}
// Dijkstra
//
//
// x1nVector
// x:
// n:
// m:
// edge: Vec<(ab)>
// distset()
// O(NlogN)
pub fn Dijkstra(
x: usize,
n: usize,
m: usize,
edge: &Vec<(usize, usize, usize)>,
) -> (Vec<usize>, HashSet<i32>) {
let mut g = vec![vec![]; n + 1];
for i in 0..m {
g[edge[i].0].push((edge[i].1, edge[i].2, i as i32 + 1));
}
let mut set = HashSet::new();
// dist[i]: xi
let mut dist = vec![usize::MAX; n + 1];
// confirm[i]: i
let mut confirm = vec![false; n + 1];
dist[x] = 0;
//
let mut heap = BinaryHeap::new();
heap.push((Reverse(0), x, -1));
while !heap.is_empty() {
// v_d
let (Reverse(_d), v, edge_i) = heap.pop().unwrap();
// v
if confirm[v] {
continue;
}
//v
confirm[v] = true;
if edge_i != -1 {
set.insert(edge_i);
}
//vpush
for &(i, cost, edge_i) in &g[v] {
if dist[i] > dist[v] + cost {
dist[i] = dist[v] + cost;
heap.push((Reverse(dist[i]), i, edge_i));
}
}
}
return (dist, set);
}
pub mod my_proconio {
#[macro_export]
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_export]
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)*}
};
($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
let mut $var = read_value!($next, $t);
input_inner!{$next $($r)*}
};
}
#[macro_export]
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")
};
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0