結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | kaki |
提出日時 | 2020-05-29 22:15:42 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 160 ms / 2,000 ms |
コード長 | 3,693 bytes |
コンパイル時間 | 1,150 ms |
コンパイル使用メモリ | 176,060 KB |
実行使用メモリ | 26,952 KB |
最終ジャッジ日時 | 2024-04-23 22:57:32 |
合計ジャッジ時間 | 5,283 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 0 ms
6,940 KB |
testcase_02 | AC | 72 ms
14,848 KB |
testcase_03 | AC | 97 ms
23,424 KB |
testcase_04 | AC | 96 ms
23,224 KB |
testcase_05 | AC | 79 ms
23,168 KB |
testcase_06 | AC | 77 ms
23,236 KB |
testcase_07 | AC | 23 ms
8,704 KB |
testcase_08 | AC | 83 ms
26,772 KB |
testcase_09 | AC | 8 ms
6,940 KB |
testcase_10 | AC | 37 ms
13,184 KB |
testcase_11 | AC | 26 ms
9,728 KB |
testcase_12 | AC | 17 ms
6,940 KB |
testcase_13 | AC | 70 ms
14,848 KB |
testcase_14 | AC | 88 ms
18,280 KB |
testcase_15 | AC | 105 ms
21,376 KB |
testcase_16 | AC | 47 ms
10,112 KB |
testcase_17 | AC | 122 ms
22,356 KB |
testcase_18 | AC | 33 ms
7,936 KB |
testcase_19 | AC | 110 ms
21,716 KB |
testcase_20 | AC | 25 ms
7,808 KB |
testcase_21 | AC | 41 ms
9,344 KB |
testcase_22 | AC | 95 ms
19,680 KB |
testcase_23 | AC | 2 ms
6,944 KB |
testcase_24 | AC | 2 ms
6,944 KB |
testcase_25 | AC | 16 ms
6,940 KB |
testcase_26 | AC | 53 ms
12,672 KB |
testcase_27 | AC | 53 ms
11,776 KB |
testcase_28 | AC | 91 ms
17,664 KB |
testcase_29 | AC | 12 ms
6,944 KB |
testcase_30 | AC | 104 ms
21,480 KB |
testcase_31 | AC | 69 ms
16,768 KB |
testcase_32 | AC | 44 ms
11,648 KB |
testcase_33 | AC | 113 ms
22,144 KB |
testcase_34 | AC | 36 ms
8,192 KB |
testcase_35 | AC | 101 ms
21,376 KB |
testcase_36 | AC | 1 ms
6,944 KB |
testcase_37 | AC | 2 ms
6,940 KB |
testcase_38 | AC | 1 ms
6,944 KB |
testcase_39 | AC | 2 ms
6,944 KB |
testcase_40 | AC | 1 ms
6,944 KB |
testcase_41 | AC | 160 ms
26,952 KB |
testcase_42 | AC | 36 ms
9,856 KB |
testcase_43 | AC | 67 ms
15,328 KB |
testcase_44 | AC | 22 ms
7,040 KB |
testcase_45 | AC | 67 ms
14,976 KB |
testcase_46 | AC | 1 ms
6,940 KB |
testcase_47 | AC | 1 ms
6,940 KB |
ソースコード
#![allow(non_snake_case)] #![allow(dead_code)] #![allow(unused_macros)] #![allow(unused_imports)] use std::str::FromStr; use std::io::*; use std::collections::*; use std::cmp::*; use std::f64::INFINITY; struct Scanner<I: Iterator<Item = char>> { iter: std::iter::Peekable<I>, } macro_rules! exit { () => {{ exit!(0) }}; ($code:expr) => {{ if cfg!(local) { writeln!(std::io::stderr(), "===== Terminated =====") .expect("failed printing to stderr"); } std::process::exit($code); }} } impl<I: Iterator<Item = char>> Scanner<I> { pub fn new(iter: I) -> Scanner<I> { Scanner { iter: iter.peekable(), } } pub fn safe_get_token(&mut self) -> Option<String> { let token = self.iter .by_ref() .skip_while(|c| c.is_whitespace()) .take_while(|c| !c.is_whitespace()) .collect::<String>(); if token.is_empty() { None } else { Some(token) } } pub fn token(&mut self) -> String { self.safe_get_token().unwrap_or_else(|| exit!()) } pub fn get<T: FromStr>(&mut self) -> T { self.token().parse::<T>().unwrap_or_else(|_| exit!()) } pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> { (0..len).map(|_| self.get()).collect() } pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> { (0..row).map(|_| self.vec(col)).collect() } pub fn char(&mut self) -> char { self.iter.next().unwrap_or_else(|| exit!()) } pub fn chars(&mut self) -> Vec<char> { self.get::<String>().chars().collect() } pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> { (0..row).map(|_| self.chars()).collect() } pub fn line(&mut self) -> String { if self.peek().is_some() { self.iter .by_ref() .take_while(|&c| !(c == '\n' || c == '\r')) .collect::<String>() } else { exit!(); } } pub fn peek(&mut self) -> Option<&char> { self.iter.peek() } } #[derive(PartialEq)] struct MinFloat(f64); impl Eq for MinFloat {} impl PartialOrd for MinFloat { fn partial_cmp(&self, other: &Self) -> Option<Ordering> { other.0.partial_cmp(&self.0) } } impl Ord for MinFloat { fn cmp(&self, other: &Self) -> Ordering { other.0.partial_cmp(&self.0).unwrap() } } fn main() { let cin = stdin(); let cin = cin.lock(); let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char)); let N: usize = sc.get(); let M: usize = sc.get(); let X: usize = sc.get::<usize>()-1; let Y: usize = sc.get::<usize>()-1; let mut p: Vec<f64> = vec![0.; N]; let mut q: Vec<f64> = vec![0.; N]; for i in 0..N { p[i] = sc.get(); q[i] = sc.get(); } let mut adj = vec![Vec::new(); N]; for _ in 0..M { let P: usize = sc.get::<usize>()-1; let Q: usize = sc.get::<usize>()-1; let cost = (p[P] - p[Q]).hypot(q[P] - q[Q]); adj[P].push((Q, cost)); adj[Q].push((P, cost)); } let mut bh = BinaryHeap::new(); bh.push((MinFloat(0.), X)); let mut dp = vec![INFINITY; N]; dp[X] = 0.; while let Some((MinFloat(cost), now)) = bh.pop() { if dp[now] < cost { continue; } for &(to, cost) in &adj[now] { if dp[to] > dp[now] + cost { dp[to] = dp[now] + cost; bh.push((MinFloat(dp[to]), to)); } } } println!("{}", dp[Y]); }