結果
問題 | No.1557 Binary Variable |
ユーザー | koba-e964 |
提出日時 | 2021-10-15 08:17:54 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 390 ms / 2,000 ms |
コード長 | 2,871 bytes |
コンパイル時間 | 1,731 ms |
コンパイル使用メモリ | 192,604 KB |
実行使用メモリ | 53,628 KB |
最終ジャッジ日時 | 2023-10-17 19:30:40 |
合計ジャッジ時間 | 13,519 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 150 ms
28,948 KB |
testcase_01 | AC | 225 ms
33,172 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 132 ms
14,496 KB |
testcase_05 | AC | 131 ms
14,496 KB |
testcase_06 | AC | 126 ms
15,024 KB |
testcase_07 | AC | 127 ms
15,024 KB |
testcase_08 | AC | 144 ms
14,760 KB |
testcase_09 | AC | 147 ms
15,024 KB |
testcase_10 | AC | 178 ms
17,400 KB |
testcase_11 | AC | 179 ms
17,664 KB |
testcase_12 | AC | 143 ms
15,024 KB |
testcase_13 | AC | 182 ms
18,192 KB |
testcase_14 | AC | 327 ms
45,776 KB |
testcase_15 | AC | 188 ms
19,248 KB |
testcase_16 | AC | 319 ms
43,136 KB |
testcase_17 | AC | 288 ms
36,604 KB |
testcase_18 | AC | 267 ms
32,116 KB |
testcase_19 | AC | 364 ms
52,572 KB |
testcase_20 | AC | 358 ms
51,252 KB |
testcase_21 | AC | 354 ms
51,252 KB |
testcase_22 | AC | 355 ms
52,044 KB |
testcase_23 | AC | 352 ms
50,988 KB |
testcase_24 | AC | 364 ms
52,836 KB |
testcase_25 | AC | 362 ms
52,836 KB |
testcase_26 | AC | 364 ms
53,100 KB |
testcase_27 | AC | 369 ms
53,364 KB |
testcase_28 | AC | 368 ms
53,364 KB |
testcase_29 | AC | 390 ms
53,628 KB |
testcase_30 | AC | 376 ms
53,364 KB |
testcase_31 | AC | 383 ms
53,628 KB |
testcase_32 | AC | 378 ms
53,364 KB |
testcase_33 | AC | 348 ms
50,196 KB |
testcase_34 | AC | 1 ms
4,348 KB |
testcase_35 | AC | 1 ms
4,348 KB |
testcase_36 | AC | 1 ms
4,348 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::*; use std::collections::*; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { ($($r:tt)*) => { let stdin = std::io::stdin(); let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock())); let mut next = move || -> String{ bytes.by_ref().map(|r|r.unwrap() as char) .skip_while(|c|c.is_whitespace()) .take_while(|c|!c.is_whitespace()) .collect() }; input_inner!{next, $($r)*} }; } macro_rules! input_inner { ($next:expr) => {}; ($next:expr,) => {}; ($next:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } macro_rules! read_value { ($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) }; ($next:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }; ($next:expr, chars) => { read_value!($next, String).chars().collect::<Vec<char>>() }; ($next:expr, usize1) => (read_value!($next, usize) - 1); ($next:expr, [ $t:tt ]) => {{ let len = read_value!($next, usize); read_value!($next, [$t; len]) }}; ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error")); } trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); } impl<T: PartialOrd> Change for T { fn chmax(&mut self, x: T) { if *self < x { *self = x; } } fn chmin(&mut self, x: T) { if *self > x { *self = x; } } } // Tags: dual-of-linar-programming fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); } fn solve() { input! { n: i64, m: usize, lr: [(i64, i64); m], } let mut coo = vec![]; for &(l, r) in &lr { coo.push(l - 1); coo.push(r); } coo.push(0); coo.push(n); coo.sort(); coo.dedup(); let k = coo.len(); const INF: i64 = 1 << 50; let mut dist = vec![INF; k]; let mut g = vec![vec![]; k]; for i in 0..k - 1 { g[i + 1].push((i, 0)); g[i].push((i + 1, coo[i + 1] - coo[i])); } for &(l, r) in &lr { let l = coo.binary_search(&(l - 1)).unwrap(); let r = coo.binary_search(&r).unwrap(); g[l].push((r, coo[r] - coo[l] - 1)); } let mut que = BinaryHeap::new(); que.push((Reverse(0), 0)); while let Some((Reverse(d), v)) = que.pop() { if dist[v] <= d { continue; } dist[v] = d; for &(w, c) in &g[v] { que.push((Reverse(d + c), w)); } } println!("{}", dist[k - 1]); }