#831091 (Rust) No.2179 Planet Traveler

提出ソース

結果

問題	No.2179 Planet Traveler
ユーザー	Moss_Local
提出日時	2023-01-06 23:19:25
言語	Rust (1.77.0)
結果	WA
実行時間	-
コード長	7,413 bytes
コンパイル時間	5,499 ms
コンパイル使用メモリ	139,632 KB
実行使用メモリ	16,584 KB
最終ジャッジ日時	2023-08-20 16:48:26
合計ジャッジ時間	7,578 ms
ジャッジサーバーID （参考情報）	judge13 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,376 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	WA	-
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	1 ms 4,384 KB
testcase_05	AC	1 ms 4,380 KB
testcase_06	AC	1 ms 4,380 KB
testcase_07	AC	1 ms 4,376 KB
testcase_08	AC	2 ms 4,376 KB
testcase_09	AC	2 ms 4,380 KB
testcase_10	AC	1 ms 4,380 KB
testcase_11	AC	23 ms 15,284 KB
testcase_12	AC	176 ms 14,888 KB
testcase_13	WA	-
testcase_14	AC	21 ms 15,256 KB
testcase_15	AC	21 ms 15,288 KB
testcase_16	AC	22 ms 15,244 KB
testcase_17	AC	220 ms 16,584 KB
testcase_18	AC	204 ms 15,468 KB
testcase_19	AC	221 ms 16,504 KB
testcase_20	AC	28 ms 4,572 KB
testcase_21	AC	188 ms 15,012 KB
testcase_22	AC	123 ms 10,424 KB
testcase_23	AC	113 ms 9,984 KB
testcase_24	AC	173 ms 14,636 KB
testcase_25	AC	132 ms 11,268 KB
testcase_26	AC	193 ms 15,536 KB
testcase_27	AC	31 ms 4,640 KB
testcase_28	AC	90 ms 8,812 KB
testcase_29	AC	179 ms 14,912 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: unnecessary parentheses around type
  --> 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`
   --> Main.rs:196:9
    |
196 |     for i in 0..n {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: 2 warnings emitted

ソースコード

raw source code

// -*- 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 djikstra(graph: &Vec<Vec<(usize, usize)>>, start: usize) -> Vec<usize> {
    let mut dist = vec![INF as usize; graph.len()];
    let mut heap = BinaryHeap::new();
    heap.push(Reverse((0 as usize, start)));
    dist[start] = 0;
    while let Some(Reverse(x)) = heap.pop() {
        let cost = x.0;
        let v = x.1;
        if cost > dist[v] {
            continue;
        }
        for edge in &graph[v] {
            let nc = max(cost, edge.1);
            let nv = edge.0;
            if nc < dist[nv] {
                heap.push(Reverse((nc, nv)));
                dist[nv] = nc;
            }
        }
    }
    return dist;
}
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 + 1) 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 f64;

            if t1 != t2 {
                let f = |x: i64| -> bool {
                    let v = (r1 - r2).abs();
                    return v * v <= (x as f64);
                };

                let mut ok = INF;
                let mut ng = 0 as i64;

                while (ng - ok).abs() > 1 {
                    let mid = (ok + ng) / 2;
                    if f(mid) {
                        ok = mid;
                    } else {
                        ng = mid;
                    }
                }
                graph[i].push((j, ok as usize));
            } else {
                graph[i].push((j, euc_dist as usize));
            }
        }
    }
    let d = djikstra(&graph, 0);
    println!("{}", d[n - 1]);
    return;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード