結果
問題 | No.2488 Mod Sum Maximization |
ユーザー | koba-e964 |
提出日時 | 2023-12-20 12:26:19 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 272 ms / 2,000 ms |
コード長 | 3,727 bytes |
コンパイル時間 | 2,023 ms |
コンパイル使用メモリ | 189,040 KB |
実行使用メモリ | 20,596 KB |
最終ジャッジ日時 | 2023-12-20 12:26:31 |
合計ジャッジ時間 | 8,938 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 11 ms
18,296 KB |
testcase_01 | AC | 7 ms
18,296 KB |
testcase_02 | AC | 4 ms
18,296 KB |
testcase_03 | AC | 242 ms
20,556 KB |
testcase_04 | AC | 266 ms
20,556 KB |
testcase_05 | AC | 255 ms
20,556 KB |
testcase_06 | AC | 227 ms
20,412 KB |
testcase_07 | AC | 173 ms
19,828 KB |
testcase_08 | AC | 234 ms
20,508 KB |
testcase_09 | AC | 180 ms
19,972 KB |
testcase_10 | AC | 137 ms
19,596 KB |
testcase_11 | AC | 12 ms
18,360 KB |
testcase_12 | AC | 126 ms
19,356 KB |
testcase_13 | AC | 105 ms
19,180 KB |
testcase_14 | AC | 30 ms
18,508 KB |
testcase_15 | AC | 147 ms
19,652 KB |
testcase_16 | AC | 13 ms
18,372 KB |
testcase_17 | AC | 50 ms
18,668 KB |
testcase_18 | AC | 18 ms
18,424 KB |
testcase_19 | AC | 194 ms
20,148 KB |
testcase_20 | AC | 211 ms
20,252 KB |
testcase_21 | AC | 208 ms
20,220 KB |
testcase_22 | AC | 230 ms
20,460 KB |
testcase_23 | AC | 242 ms
20,596 KB |
testcase_24 | AC | 92 ms
19,076 KB |
testcase_25 | AC | 10 ms
18,344 KB |
testcase_26 | AC | 15 ms
18,396 KB |
testcase_27 | AC | 150 ms
19,388 KB |
testcase_28 | AC | 156 ms
19,444 KB |
testcase_29 | AC | 148 ms
19,356 KB |
testcase_30 | AC | 98 ms
19,028 KB |
testcase_31 | AC | 24 ms
18,364 KB |
testcase_32 | AC | 230 ms
20,092 KB |
testcase_33 | AC | 6 ms
18,308 KB |
testcase_34 | AC | 272 ms
20,460 KB |
testcase_35 | AC | 92 ms
18,964 KB |
testcase_36 | AC | 6 ms
18,296 KB |
testcase_37 | AC | 4 ms
18,296 KB |
testcase_38 | AC | 4 ms
18,296 KB |
testcase_39 | AC | 6 ms
18,296 KB |
testcase_40 | AC | 5 ms
18,296 KB |
ソースコード
use std::cmp::*; #[allow(unused_imports)] 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")); } // 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. 2220 (https://yukicoder.me/submissions/841554) struct SegTree<I, BiOp> { n: usize, orign: 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, orign: n_, dat: vec![e; 2 * n - 1], op: op, e: e} } // ary[k] <- v pub fn update(&mut self, idx: usize, v: I) { debug_assert!(idx < self.orign); 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) (half-inclusive) // http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ #[allow(unused)] pub fn query(&self, rng: std::ops::Range<usize>) -> I { let (mut a, mut b) = (rng.start, rng.end); debug_assert!(a <= b); debug_assert!(b <= self.orign); 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) } } fn main() { input! { n: usize, a: [usize; n], } const W: usize = 1_000_001; const INF: i64 = 1 << 58; let mut st = SegTree::new(W, min, INF); st.update(a[n - 1], 0); for i in (0..n - 1).rev() { let x = a[i]; let mut me = INF; for y in 1..=(W - 1) / x { let val = st.query(max(x * y, x + 1)..min(x * y + x, W)); me = min(me, val + x as i64 * y as i64); } st.update(x, me); } let mut ans: i64 = a.iter().sum::<usize>() as _; ans -= st.query(a[0]..a[0] + 1); println!("{}", ans); }