結果
問題 | No.409 ダイエット |
ユーザー | akakimidori |
提出日時 | 2019-10-01 07:31:50 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 111 ms / 2,000 ms |
コード長 | 4,084 bytes |
コンパイル時間 | 1,937 ms |
コンパイル使用メモリ | 174,116 KB |
実行使用メモリ | 31,092 KB |
最終ジャッジ日時 | 2024-04-14 08:29:15 |
合計ジャッジ時間 | 7,704 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 1 ms
6,940 KB |
testcase_13 | AC | 1 ms
6,940 KB |
testcase_14 | AC | 1 ms
6,944 KB |
testcase_15 | AC | 1 ms
6,944 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,944 KB |
testcase_18 | AC | 1 ms
6,944 KB |
testcase_19 | AC | 1 ms
6,944 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 1 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,940 KB |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | AC | 1 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,944 KB |
testcase_27 | AC | 1 ms
6,944 KB |
testcase_28 | AC | 1 ms
6,944 KB |
testcase_29 | AC | 1 ms
6,944 KB |
testcase_30 | AC | 1 ms
6,944 KB |
testcase_31 | AC | 1 ms
6,940 KB |
testcase_32 | AC | 1 ms
6,944 KB |
testcase_33 | AC | 1 ms
6,940 KB |
testcase_34 | AC | 1 ms
6,940 KB |
testcase_35 | AC | 2 ms
6,940 KB |
testcase_36 | AC | 2 ms
6,940 KB |
testcase_37 | AC | 1 ms
6,940 KB |
testcase_38 | AC | 2 ms
6,944 KB |
testcase_39 | AC | 2 ms
6,940 KB |
testcase_40 | AC | 2 ms
6,944 KB |
testcase_41 | AC | 2 ms
6,944 KB |
testcase_42 | AC | 1 ms
6,944 KB |
testcase_43 | AC | 1 ms
6,940 KB |
testcase_44 | AC | 1 ms
6,944 KB |
testcase_45 | AC | 2 ms
6,940 KB |
testcase_46 | AC | 2 ms
6,944 KB |
testcase_47 | AC | 1 ms
6,940 KB |
testcase_48 | AC | 1 ms
6,944 KB |
testcase_49 | AC | 2 ms
6,944 KB |
testcase_50 | AC | 2 ms
6,944 KB |
testcase_51 | AC | 1 ms
6,940 KB |
testcase_52 | AC | 1 ms
6,944 KB |
testcase_53 | AC | 1 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,944 KB |
testcase_55 | AC | 49 ms
15,856 KB |
testcase_56 | AC | 68 ms
29,808 KB |
testcase_57 | AC | 108 ms
30,064 KB |
testcase_58 | AC | 39 ms
10,244 KB |
testcase_59 | AC | 60 ms
16,764 KB |
testcase_60 | AC | 35 ms
9,920 KB |
testcase_61 | AC | 85 ms
18,916 KB |
testcase_62 | AC | 102 ms
29,720 KB |
testcase_63 | AC | 84 ms
18,832 KB |
testcase_64 | AC | 48 ms
15,544 KB |
testcase_65 | AC | 94 ms
29,260 KB |
testcase_66 | AC | 104 ms
29,892 KB |
testcase_67 | AC | 73 ms
17,864 KB |
testcase_68 | AC | 59 ms
16,740 KB |
testcase_69 | AC | 82 ms
18,680 KB |
testcase_70 | AC | 82 ms
19,196 KB |
testcase_71 | AC | 42 ms
11,104 KB |
testcase_72 | AC | 111 ms
31,092 KB |
testcase_73 | AC | 89 ms
20,116 KB |
testcase_74 | AC | 59 ms
17,160 KB |
testcase_75 | AC | 101 ms
30,296 KB |
testcase_76 | AC | 68 ms
17,856 KB |
testcase_77 | AC | 42 ms
10,888 KB |
testcase_78 | AC | 53 ms
16,568 KB |
testcase_79 | AC | 38 ms
10,496 KB |
testcase_80 | AC | 104 ms
30,696 KB |
testcase_81 | AC | 89 ms
20,020 KB |
testcase_82 | AC | 68 ms
17,940 KB |
testcase_83 | AC | 73 ms
18,488 KB |
testcase_84 | AC | 60 ms
17,288 KB |
testcase_85 | AC | 7 ms
6,940 KB |
testcase_86 | AC | 59 ms
17,108 KB |
testcase_87 | AC | 82 ms
19,220 KB |
testcase_88 | AC | 31 ms
9,868 KB |
testcase_89 | AC | 63 ms
18,068 KB |
testcase_90 | AC | 28 ms
9,792 KB |
testcase_91 | AC | 66 ms
18,532 KB |
ソースコード
//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // // おためしLi Chao Tree // 最小値習得 struct LiChaoTree { seg: Vec<(i64, i64)>, bit: usize, z: Vec<i64>, } const INF_LINE: (i64, i64) = (0, 2_000_000_000_000_000_001); impl LiChaoTree { fn new(z: &Vec<i64>) -> Self { let mut z = z.clone(); z.sort(); z.dedup(); let mut k = 0; while (1 << k) < z.len() { k += 1; } let p = *z.last().unwrap(); while z.len() < (1 << k) { z.push(p); } LiChaoTree { seg: vec![INF_LINE; 2 << k], bit: k, z: z, } } //直線ax + b を追加 fn update(&mut self, a: i64, b: i64) { let mut state = ((a, b), 1, 0, (1 << self.bit)); loop { let ((a, b), k, l, r) = state; let (c, d) = self.seg[k]; let fl = a * self.z[l] + b; let fr = a * self.z[r - 1] + b; let gl = c * self.z[l] + d; let gr = c * self.z[r - 1] + d; if fl >= gl && fr >= gr { break; } if fl <= gl && fr <= gr { self.seg[k] = (a, b); break; } let m = (l + r) / 2; let fm = a * self.z[m] + b; let gm = c * self.z[m] + d; state = if fr >= gr && fm >= gm { ((a, b), 2 * k, l, m) } else if fr >= gr { self.seg[k] = (a, b); ((c, d), 2 * k + 1, m, r) } else if fm >= gm { ((a, b), 2 * k + 1, m, r) } else { self.seg[k] = (a, b); ((c, d), 2 * k, l, m) }; } } fn find(&self, x: i64) -> i64 { let k = self.z.binary_search(&x).unwrap(); let mut y = k + (1 << self.bit); let mut res = std::i64::MAX; while y >= 1 { let (a, b) = self.seg[y]; res = std::cmp::min(res, a * x + b); y >>= 1; } res } } fn run() { input! { n: usize, a: i64, b: i64, w: i64, d: [i64; n], } let (a, b, w) = (2 * a, 2 * b, 2 * w); let mut d = d; for d in &mut d { *d *= 2; } let z: Vec<i64> = (0..=n).map(|k| k as i64).collect(); let mut cht = LiChaoTree::new(&z); cht.update(0, w); let mut dp = vec![w; n + 1]; for i in 1..=n { let k = i as i64; dp[i] = d[i - 1] + -a * (k - 1) + b / 2 * k * (k - 1) + cht.find(k); cht.update(-b * k, dp[i] + a * k + b * k * k / 2 + b / 2 * k); } let mut ans = dp[n]; for i in 0..n { let k = (n - i) as i64; let v = dp[i] - a * k + b / 2 * k * (k + 1); ans = std::cmp::min(ans, v); } ans /= 2; println!("{}", ans); } fn main() { run(); }