結果
問題 | No.1234 典型RMQ |
ユーザー | fukafukatani |
提出日時 | 2020-09-18 22:10:49 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 630 ms / 2,000 ms |
コード長 | 3,131 bytes |
コンパイル時間 | 5,731 ms |
コンパイル使用メモリ | 151,588 KB |
実行使用メモリ | 7,412 KB |
最終ジャッジ日時 | 2023-08-08 18:43:49 |
合計ジャッジ時間 | 12,919 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 456 ms
6,196 KB |
testcase_07 | AC | 447 ms
5,368 KB |
testcase_08 | AC | 468 ms
6,940 KB |
testcase_09 | AC | 457 ms
6,152 KB |
testcase_10 | AC | 461 ms
6,548 KB |
testcase_11 | AC | 439 ms
6,324 KB |
testcase_12 | AC | 443 ms
5,728 KB |
testcase_13 | AC | 431 ms
5,524 KB |
testcase_14 | AC | 437 ms
5,792 KB |
testcase_15 | AC | 444 ms
5,632 KB |
testcase_16 | AC | 459 ms
6,384 KB |
testcase_17 | AC | 447 ms
5,788 KB |
testcase_18 | AC | 411 ms
5,396 KB |
testcase_19 | AC | 453 ms
6,396 KB |
testcase_20 | AC | 377 ms
6,488 KB |
testcase_21 | AC | 452 ms
6,228 KB |
testcase_22 | AC | 630 ms
7,156 KB |
testcase_23 | AC | 613 ms
7,164 KB |
testcase_24 | AC | 617 ms
7,412 KB |
testcase_25 | AC | 614 ms
7,176 KB |
testcase_26 | AC | 612 ms
7,360 KB |
testcase_27 | AC | 1 ms
4,376 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 1 ms
4,380 KB |
コンパイルメッセージ
warning: unused variable: `i` --> Main.rs:33:9 | 33 | for i in 0..q { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default warning: 1 warning emitted
ソースコード
#![allow(unused_imports)] use std::cmp::*; use std::collections::*; use std::io::Write; use std::ops::Bound::*; #[allow(unused_macros)] macro_rules! debug { ($($e:expr),*) => { #[cfg(debug_assertions)] $({ let (e, mut err) = (stringify!($e), std::io::stderr()); writeln!(err, "{} = {:?}", e, $e).unwrap() })* }; } fn main() { let n = read::<usize>(); let mut a = read_vec::<i64>(); let num_buckets = 1000; let bucket_width = 1000; let mut bucket_added = vec![0; num_buckets]; let mut bucket_min = vec![std::i64::MAX; num_buckets]; for i in 0..n { bucket_min[i / bucket_width] = min(a[i], bucket_min[i / bucket_width]); } let q = read::<usize>(); let mut queries = vec![]; for i in 0..q { let v = read_vec::<i64>(); let (k, l, r, c) = (v[0], v[1] as usize - 1, v[2] as usize - 1, v[3]); queries.push((k, l, r, c)); } for (k, l, r, c) in queries { if k == 1 { let mut tl = 0; let mut tr = bucket_width - 1; for bi in 0..num_buckets { if r < tl || l > tr { // Nothing } else if l <= tl && r >= tr { bucket_added[bi] += c; bucket_min[bi] += c; } else { for i in 0..bucket_width { if i + tl >= l && i + tl <= r { a[i + tl] += c; } } bucket_min[bi] = std::i64::MAX; for i in 0..bucket_width { if i + tl >= n { break; } bucket_min[bi] = min(a[i + tl] + bucket_added[bi], bucket_min[bi]); } } tl += bucket_width; tr += bucket_width; } } else { let mut tl = 0; let mut tr = bucket_width - 1; let mut ans = std::i64::MAX; for bi in 0..num_buckets { if r < tl || l > tr { // Nothing } else if l <= tl && r >= tr { ans = min(ans, bucket_min[bi]); } else { for i in 0..bucket_width { if i + tl >= l && i + tl <= r { if i + tl >= n { break; } ans = min(ans, a[i + tl] + bucket_added[bi]); } } } tl += bucket_width; tr += bucket_width; } println!("{}", ans); } } } 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() } fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() }