結果
問題 | No.1441 MErGe |
ユーザー | koba-e964 |
提出日時 | 2021-11-19 02:08:02 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 137 ms / 1,000 ms |
コード長 | 5,777 bytes |
コンパイル時間 | 12,044 ms |
コンパイル使用メモリ | 377,068 KB |
実行使用メモリ | 12,928 KB |
最終ジャッジ日時 | 2024-06-08 17:29:36 |
合計ジャッジ時間 | 17,508 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 4 ms
5,376 KB |
testcase_06 | AC | 4 ms
5,376 KB |
testcase_07 | AC | 4 ms
5,376 KB |
testcase_08 | AC | 32 ms
5,376 KB |
testcase_09 | AC | 30 ms
5,376 KB |
testcase_10 | AC | 47 ms
5,504 KB |
testcase_11 | AC | 45 ms
5,376 KB |
testcase_12 | AC | 47 ms
5,504 KB |
testcase_13 | AC | 111 ms
11,520 KB |
testcase_14 | AC | 111 ms
11,648 KB |
testcase_15 | AC | 110 ms
11,648 KB |
testcase_16 | AC | 115 ms
11,520 KB |
testcase_17 | AC | 102 ms
11,264 KB |
testcase_18 | AC | 96 ms
9,728 KB |
testcase_19 | AC | 108 ms
11,008 KB |
testcase_20 | AC | 84 ms
9,344 KB |
testcase_21 | AC | 73 ms
8,192 KB |
testcase_22 | AC | 97 ms
9,728 KB |
testcase_23 | AC | 137 ms
12,672 KB |
testcase_24 | AC | 137 ms
12,800 KB |
testcase_25 | AC | 136 ms
12,800 KB |
testcase_26 | AC | 135 ms
12,928 KB |
testcase_27 | AC | 136 ms
12,672 KB |
testcase_28 | AC | 81 ms
12,928 KB |
testcase_29 | AC | 81 ms
12,800 KB |
ソースコード
use std::cmp::*; use std::io::{Write, BufWriter}; // 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, usize1) => (read_value!($next, usize) - 1); ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error")); } /** * Segment Tree. This data structure is useful for fast folding on intervals of an array * whose elements are elements of monoid I. Note that constructing this tree requires the identity * element of I and the operation of I. * Verified by: yukicoder No. 259 (http://yukicoder.me/submissions/100581) * AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001) * yukicoder No. 833 (https://yukicoder.me/submissions/703521) */ struct SegTree<I, BiOp> { n: usize, dat: Vec<I>, op: BiOp, e: I, } impl<I, BiOp> SegTree<I, BiOp> where BiOp: Fn(I, I) -> I, I: Copy { pub fn new(n_: usize, op: BiOp, e: I) -> Self { let mut n = 1; while n < n_ { n *= 2; } // n is a power of 2 SegTree {n: n, dat: vec![e; 2 * n - 1], op: op, e: e} } /* ary[k] <- v */ pub fn update(&mut self, idx: usize, v: I) { let mut k = idx + self.n - 1; self.dat[k] = v; while k > 0 { k = (k - 1) / 2; self.dat[k] = (self.op)(self.dat[2 * k + 1], self.dat[2 * k + 2]); } } /* [a, b) (note: half-inclusive) * http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */ #[allow(unused)] pub fn query(&self, mut a: usize, mut b: usize) -> I { let mut left = self.e; let mut right = self.e; a += self.n - 1; b += self.n - 1; while a < b { if (a & 1) == 0 { left = (self.op)(left, self.dat[a]); } if (b & 1) == 0 { right = (self.op)(self.dat[b - 1], right); } a = a / 2; b = (b - 1) / 2; } (self.op)(left, right) } } // Depends on: datastr/SegTree.rs impl<I, BiOp> SegTree<I, BiOp> where BiOp: Fn(I, I) -> I, I: Copy { // Port from https://github.com/atcoder/ac-library/blob/master/atcoder/segtree.hpp #[allow(unused)] fn max_right<F: Fn(I) -> bool>( &self, mut l: usize, f: &F, ) -> usize { assert!(f(self.e)); if l == self.n { return self.n; } l += self.n - 1; let mut sm = self.e; loop { while l % 2 == 1 { l = (l - 1) / 2; } if !f((self.op)(sm, self.dat[l])) { while l < self.n - 1 { l = 2 * l + 1; let val = (self.op)(sm, self.dat[l]); if f(val) { sm = val; l += 1; } } return l + 1 - self.n; } sm = (self.op)(sm, self.dat[l]); l += 1; if (l + 1).is_power_of_two() { break; } } self.n } // Port from https://github.com/atcoder/ac-library/blob/master/atcoder/segtree.hpp #[allow(unused)] fn min_left<F: Fn(I) -> bool>( &self, mut r: usize, f: &F, ) -> usize { if !f(self.e) { return r + 1; } if r == 0 { return 0; } r += self.n - 1; let mut sm = self.e; loop { r -= 1; while r > 0 && r % 2 == 0 { r = (r - 1) / 2; } if !f((self.op)(self.dat[r], sm)) { while r < self.n - 1 { r = 2 * r + 2; let val = (self.op)(self.dat[r], sm); if f(val) { sm = val; r -= 1; } } return r + 2 - self.n; } sm = (self.op)(self.dat[r], sm); if (r + 1).is_power_of_two() { break; } } 0 } } fn main() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} input! { n: usize, q: usize, a: [i64; n], tlr: [(i32, usize1, usize); q], } let mut acc = vec![0; n + 1]; for i in 0..n { acc[i + 1] = acc[i] + a[i]; } let mut st = SegTree::new(n, |x, y| x + y, 0); for i in 0..n { st.update(i, 1); } for (t, l, r) in tlr { if t == 1 { for _ in l + 1..r { let to = st.max_right(0, &|x| x <= l + 1); st.update(to, 0); } } else { let lto = min(n, st.max_right(0, &|x| x <= l)); let rto = min(n, st.max_right(0, &|x| x <= r)); puts!("{}\n", acc[rto] - acc[lto]); } } }