結果

問題 No.2805 Go to School
ユーザー Moss_LocalMoss_Local
提出日時 2024-07-13 10:10:23
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 210 ms / 2,000 ms
コード長 4,964 bytes
コンパイル時間 11,777 ms
コンパイル使用メモリ 402,460 KB
実行使用メモリ 23,860 KB
最終ジャッジ日時 2024-07-16 01:42:07
合計ジャッジ時間 15,719 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 65 ms
15,488 KB
testcase_05 AC 82 ms
12,420 KB
testcase_06 AC 46 ms
7,680 KB
testcase_07 AC 40 ms
7,680 KB
testcase_08 AC 67 ms
13,056 KB
testcase_09 AC 50 ms
7,388 KB
testcase_10 AC 43 ms
7,552 KB
testcase_11 AC 210 ms
21,508 KB
testcase_12 AC 109 ms
12,952 KB
testcase_13 AC 162 ms
16,952 KB
testcase_14 AC 19 ms
5,632 KB
testcase_15 AC 1 ms
5,376 KB
testcase_16 AC 0 ms
5,376 KB
testcase_17 AC 1 ms
5,376 KB
testcase_18 AC 66 ms
9,804 KB
testcase_19 AC 43 ms
7,360 KB
testcase_20 AC 107 ms
13,772 KB
testcase_21 AC 176 ms
22,388 KB
testcase_22 AC 69 ms
10,824 KB
testcase_23 AC 106 ms
12,740 KB
testcase_24 AC 106 ms
12,456 KB
testcase_25 AC 30 ms
8,316 KB
testcase_26 AC 152 ms
23,860 KB
testcase_27 AC 73 ms
19,592 KB
testcase_28 AC 6 ms
6,016 KB
testcase_29 AC 11 ms
7,552 KB
testcase_30 AC 35 ms
14,108 KB
testcase_31 AC 53 ms
9,252 KB
testcase_32 AC 98 ms
18,580 KB
testcase_33 AC 134 ms
18,388 KB
testcase_34 AC 1 ms
5,376 KB
testcase_35 AC 1 ms
5,376 KB
testcase_36 AC 46 ms
8,168 KB
testcase_37 AC 53 ms
11,136 KB
testcase_38 AC 124 ms
17,920 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: variable does not need to be mutable
   --> src/main.rs:122:9
    |
122 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:128:9
    |
128 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:133:9
    |
133 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:139:9
    |
139 |     let mut vec: Vec<f64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:144:9
    |
144 |     let mut vec: Vec<char> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:149:9
    |
149 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:154:9
    |
154 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:160:9
    |
160 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: unused variable: `l`
   --> src/main.rs:188:16
    |
188 |     let (n, m, l, s, e) = (vec[0], vec[1], vec[2], vec[3], vec[4]);
    |                ^ help: if this is intentional, prefix it with an underscore: `_l`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
   --> s

ソースコード

diff # 

// -*- 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::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// 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) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

fn main() {
    solve();
}

//input output
#[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 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 vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

fn dijkstra(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 = cost + edge.1;
            let nv = edge.0;
            if nc < dist[nv] {
                heap.push(Reverse((nc, nv)));
                dist[nv] = nc;
            }
        }
    }
    return dist;
}
fn solve() {
    let mut vec: Vec<usize> = read_vec();
    let (n, m, l, s, e) = (vec[0], vec[1], vec[2], vec[3], vec[4]);
    let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize];
    for _ in 0..m {
        let vec: Vec<usize> = read_vec();
        let (a, b, c) = (vec[0], vec[1], vec[2]);
        graph[a - 1].push((b - 1, c));
        graph[b - 1].push((a - 1, c));
    }
    let mut t: Vec<usize> = read_vec();

    t.iter_mut().for_each(|x| *x -= 1);
    let d = dijkstra(&graph, 0);
    let d2 = dijkstra(&graph, n - 1);
    let mut ans = UINF;
    for i in 0..t.len() {
        let v = t[i];
        if d[v] >= s + e {
            continue;
        }
        if v == n - 1 {
            ans = min(ans, max(s, d[v]) + 1);
            continue;
        }
        ans = min(ans, max(s, d[v]) + 1 + d2[v]);
    }
    // d!(d);
    // d!(d2);

    if ans == UINF {
        p!(-1);
    } else {
        p!(ans);
    }

    return;
}
0