結果
問題 | No.618 labo-index |
ユーザー | koba-e964 |
提出日時 | 2021-11-05 11:23:48 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 232 ms / 6,000 ms |
コード長 | 5,558 bytes |
コンパイル時間 | 15,041 ms |
コンパイル使用メモリ | 379,508 KB |
実行使用メモリ | 11,264 KB |
最終ジャッジ日時 | 2024-10-15 20:03:24 |
合計ジャッジ時間 | 19,493 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 | 1 ms
5,248 KB |
testcase_04 | AC | 3 ms
5,248 KB |
testcase_05 | AC | 3 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 1 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 3 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 3 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 3 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 5 ms
5,248 KB |
testcase_19 | AC | 183 ms
7,040 KB |
testcase_20 | AC | 181 ms
7,040 KB |
testcase_21 | AC | 187 ms
7,040 KB |
testcase_22 | AC | 184 ms
7,040 KB |
testcase_23 | AC | 182 ms
7,168 KB |
testcase_24 | AC | 181 ms
6,912 KB |
testcase_25 | AC | 183 ms
7,040 KB |
testcase_26 | AC | 185 ms
7,040 KB |
testcase_27 | AC | 189 ms
7,040 KB |
testcase_28 | AC | 182 ms
7,040 KB |
testcase_29 | AC | 190 ms
7,040 KB |
testcase_30 | AC | 187 ms
6,912 KB |
testcase_31 | AC | 185 ms
7,040 KB |
testcase_32 | AC | 185 ms
7,168 KB |
testcase_33 | AC | 182 ms
7,168 KB |
testcase_34 | AC | 227 ms
11,264 KB |
testcase_35 | AC | 232 ms
11,264 KB |
testcase_36 | AC | 143 ms
5,248 KB |
testcase_37 | AC | 196 ms
7,296 KB |
testcase_38 | AC | 1 ms
5,248 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, $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 } } fn main() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} input! { q: usize, tx: [(i32, i64); q], } let mut coo = vec![]; let mut bias = 0; for &(t, x) in &tx { if t == 1 { coo.push(x - bias); } if t == 3 { bias += x; } } coo.sort_unstable(); coo.dedup(); let m = coo.len(); const INF: i64 = 1 << 50; let mut st = SegTree::new(m, |(a, s, x), (b, t, y)| if x < y { (a + b + s, t, y) } else { (a + b + t, s, x) }, (0, 0, -INF)); for i in 0..m { st.update(i, (0, 0, coo[i])); } bias = 0; let mut dat = vec![]; for &(t, x) in &tx { if t == 1 { let idx = coo.binary_search(&(x - bias)).unwrap(); dat.push(idx); let (a, s, b) = st.query(idx, idx + 1); st.update(idx, (a, s + 1, b)); } else if t == 2 { let idx = dat[x as usize - 1]; let (a, s, b) = st.query(idx, idx + 1); st.update(idx, (a, s - 1, b)); } else { bias += x; } let whole = { let (a, b, _) = st.query(0, m); a + b }; let idx = st.max_right(0, &|(a, _, x)| whole - a >= x + bias); let (a, _, b) = st.query(0, idx); let mut ans = min(whole - a, b + bias); if idx + 1 <= m { let (a, _, b) = st.query(0, idx + 1); ans = max(ans, min(whole - a, b + bias)); } puts!("{}\n", max(0, ans)); eprintln!(); } }