結果
| 問題 | No.2179 Planet Traveler |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2023-01-06 23:35:08 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 1,909 ms / 3,000 ms |
| コード長 | 6,918 bytes |
| コンパイル時間 | 15,370 ms |
| コンパイル使用メモリ | 384,332 KB |
| 実行使用メモリ | 20,096 KB |
| 最終ジャッジ日時 | 2024-11-30 20:33:38 |
| 合計ジャッジ時間 | 38,256 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 26 |
コンパイルメッセージ
warning: unnecessary parentheses around type
--> src/main.rs:61:15
|
61 | fn readi() -> (i64) {
| ^ ^
|
= note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
|
61 - fn readi() -> (i64) {
61 + fn readi() -> i64 {
|
warning: unused variable: `i`
--> src/main.rs:195:9
|
195 | for i in 0..n {
| ^ help: if this is intentional, prefix it with an underscore: `_i`
|
= note: `#[warn(unused_variables)]` on by default
ソースコード
// -*- coding:utf-8-unix -*-// #![feature(map_first_last)]#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]use core::num;use std::cmp::*;use std::*;const INF: i64 = 1223372036854775807;const UINF: usize = INF as usize;const LINF: i64 = 2147483647;const INF128: i128 = 1223372036854775807000000000000;// const MOD: i64 = 1000000007;const MOD: i64 = 998244353;const UMOD: usize = MOD as usize;const M_PI: f64 = 3.14159265358979323846;// const MOD: i64 = INF;use cmp::Ordering::*;use std::collections::*;use std::io::stdin;use std::io::stdout;use std::io::Write;macro_rules! p {($x:expr) => {println!("{}", $x);};}macro_rules! d {($x:expr) => {println!("{:?}", $x);};}#[allow(unused_macros)]pub mod macros {macro_rules! min { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); std::cmp::min($x, y) } }}macro_rules! max { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); std::cmp::max($x, y) } }}macro_rules! chmin { ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); if $x > y { $x = y; true } else { false } }}}macro_rules! chmax { ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); if $x < y { $x = y; true } else { false } }}}macro_rules! multi_vec { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_vec![$element; ($($lens),*)]; $len] );($element: expr; ($len: expr)) => ( vec![$element; $len] ); }macro_rules! multi_box_array { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_box_array![$element; ($($lens),*)]; $len].into_boxed_slice() ); ($element: expr; ($len: expr)) => ( vec![$element; $len].into_boxed_slice() ); }#[allow(unused_imports)]pub(super) use {chmax, chmin, max, min, multi_box_array, multi_vec};}use macros::*;fn main() {solve();}// use str::Chars;#[allow(dead_code)]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()}#[allow(dead_code)]fn readi() -> (i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();iter.next().unwrap().parse::<i64>().unwrap()}#[allow(dead_code)]fn read_vec<T: std::str::FromStr>() -> Vec<T> {read::<String>().split_whitespace().map(|e| e.parse().ok().unwrap()).collect()}#[allow(dead_code)]fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {(0..n).map(|_| read_vec()).collect()}#[allow(dead_code)]fn readii() -> (i64, i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}#[allow(dead_code)]fn readiii() -> (i64, i64, i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}#[allow(dead_code)]fn readuu() -> (usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}#[allow(dead_code)]fn readff() -> (f64, f64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<f64>().unwrap(),iter.next().unwrap().parse::<f64>().unwrap(),)}fn readcc() -> (char, char) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<char>().unwrap(),iter.next().unwrap().parse::<char>().unwrap(),)}fn readuuu() -> (usize, usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}#[allow(dead_code)]fn readiiii() -> (i64, i64, i64, i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}#[allow(dead_code)]fn readuuuu() -> (usize, usize, usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}fn warshall_floyd(graph: &Vec<Vec<(usize, usize)>>) -> Vec<Vec<usize>> {let n = graph.len();let mut res: Vec<Vec<usize>> =vec![vec![INF as usize; (graph.len()) as usize]; (graph.len()) as usize];for i in 0..n {res[i][i] = 0;}for i in 0..n {for v in graph[i].iter() {res[i][v.0] = v.1;}}for k in 0..n {for i in 0..n {for j in 0..n {res[i][j] = min(res[i][j], max(res[i][k], res[k][j]));}}}res}fn solve() {let n: usize = read();let mut data = vec![];for i in 0..n {let (x, y, t) = readiii();data.push((x, y, t));}let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize];for i in 0..n {for j in 0..n {if i == j {continue;}let (x1, y1, t1) = data[i];let (x2, y2, t2) = data[j];let r1 = ((x1 * x1 + y1 * y1) as f64).sqrt();let r2 = ((x2 * x2 + y2 * y2) as f64).sqrt();let euc_dist = ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) as usize;if t1 != t2 {let d = ((r1 - r2).abs() * (r1 - r2).abs() - 0.000000001).ceil() as usize;graph[i].push((j, d));} else {graph[i].push((j, euc_dist as usize));}}}let d = warshall_floyd(&graph);println!("{}", d[0][n - 1]);return;}