結果
問題 | No.2387 Yokan Factory |
ユーザー | Moss_Local |
提出日時 | 2023-07-21 21:50:57 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 606 ms / 5,000 ms |
コード長 | 6,462 bytes |
コンパイル時間 | 2,406 ms |
コンパイル使用メモリ | 176,104 KB |
実行使用メモリ | 12,892 KB |
最終ジャッジ日時 | 2023-10-21 21:50:22 |
合計ジャッジ時間 | 7,265 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 0 ms
4,348 KB |
testcase_04 | AC | 1 ms
4,348 KB |
testcase_05 | AC | 1 ms
4,348 KB |
testcase_06 | AC | 0 ms
4,348 KB |
testcase_07 | AC | 1 ms
4,348 KB |
testcase_08 | AC | 1 ms
4,348 KB |
testcase_09 | AC | 1 ms
4,348 KB |
testcase_10 | AC | 1 ms
4,348 KB |
testcase_11 | AC | 1 ms
4,348 KB |
testcase_12 | AC | 0 ms
4,348 KB |
testcase_13 | AC | 1 ms
4,348 KB |
testcase_14 | AC | 1 ms
4,348 KB |
testcase_15 | AC | 244 ms
11,508 KB |
testcase_16 | AC | 171 ms
12,532 KB |
testcase_17 | AC | 416 ms
12,892 KB |
testcase_18 | AC | 434 ms
12,472 KB |
testcase_19 | AC | 310 ms
8,352 KB |
testcase_20 | AC | 253 ms
7,908 KB |
testcase_21 | AC | 561 ms
11,272 KB |
testcase_22 | AC | 219 ms
6,692 KB |
testcase_23 | AC | 344 ms
8,320 KB |
testcase_24 | AC | 213 ms
7,328 KB |
testcase_25 | AC | 211 ms
5,988 KB |
testcase_26 | AC | 439 ms
9,108 KB |
testcase_27 | AC | 606 ms
10,660 KB |
testcase_28 | AC | 3 ms
4,348 KB |
testcase_29 | AC | 3 ms
4,348 KB |
testcase_30 | AC | 3 ms
4,348 KB |
testcase_31 | AC | 3 ms
4,348 KB |
testcase_32 | AC | 2 ms
4,348 KB |
testcase_33 | AC | 2 ms
4,348 KB |
testcase_34 | AC | 3 ms
4,348 KB |
testcase_35 | AC | 2 ms
4,348 KB |
testcase_36 | AC | 1 ms
4,348 KB |
testcase_37 | AC | 1 ms
4,348 KB |
コンパイルメッセージ
warning: unused variable: `i` --> Main.rs:217:9 | 217 | for i in 0..m { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default warning: 1 warning emitted
ソースコード
// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] use std::arch::x86_64::_MM_FROUND_NEARBYINT; // 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) => { println!("{:?}", $x); }; } macro_rules! yn { ($val:expr) => { if $val { println!("Yes"); } else { println!("No"); } }; } 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 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 (n, m, xx) = readuuu(); let mut es = vec![]; for i in 0..m { let (a, b, c, d) = readuuuu(); es.push((a - 1, b - 1, c, d)); } let f = |x: i64| -> bool { let x = x as usize; let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize]; for e in &es { let (a, b, c, d) = *e; if x > d { continue; } graph[a].push((b, c)); graph[b].push((a, c)); } let dist = dijkstra(&graph, 0); // d!(dist); return dist[n - 1] <= xx; }; let mut ok = -1; let mut ng = INF; while (ng - ok).abs() > 1 { let mid = (ok + ng) / 2; if f(mid) { ok = mid; } else { ng = mid; } } // d!((ok)); if ok + 1 == INF { p!("-1"); } else { p!(ok); } }