結果
問題 | No.1734 Decreasing Elements |
ユーザー |
![]() |
提出日時 | 2021-11-05 22:55:33 |
言語 | Rust (1.83.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,564 bytes |
コンパイル時間 | 14,690 ms |
コンパイル使用メモリ | 383,480 KB |
実行使用メモリ | 19,716 KB |
最終ジャッジ日時 | 2024-11-06 14:05:00 |
合計ジャッジ時間 | 24,196 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 7 WA * 17 |
コンパイルメッセージ
warning: unused import: `std::io::Write` --> src/main.rs:51:5 | 51 | use std::io::Write; | ^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: type alias `Map` is never used --> src/main.rs:54:6 | 54 | type Map<K, V> = BTreeMap<K, V>; | ^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias `Deque` is never used --> src/main.rs:56:6 | 56 | type Deque<T> = VecDeque<T>; | ^^^^^
ソースコード
// ---------- begin input macro ----------// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_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, bytes) => {read_value!($iter, String).bytes().collect::<Vec<u8>>()};($iter:expr, usize1) => {read_value!($iter, usize) - 1};($iter:expr, $t:ty) => {$iter.next().unwrap().parse::<$t>().expect("Parse error")};}// ---------- end input macro ----------use std::io::Write;use std::collections::*;type Map<K, V> = BTreeMap<K, V>;type Set<T> = BTreeSet<T>;type Deque<T> = VecDeque<T>;fn run() {input! {n: usize,a: [i32; n],}let pos = |x: i32| -> usize {assert!(x > 0);(x as u32).next_power_of_two().trailing_zeros() as usize};let w = 20;let mut value_pos = vec![Set::new(); w];let mut pos_value = vec![Set::new(); w];let mut dp = vec![0; w];for (i, &a) in a.iter().enumerate() {if a > 0 {let p = pos(a);value_pos[p].insert((a, i));pos_value[p].insert((i, a));}}let mut ans = 0;loop {let mut index = n;let mut v = 0;for (i, set) in pos_value.iter().enumerate() {if let Some(&(k, a)) = set.iter().next() {if k < index {index = k;v = a + dp[i];}}}if index == n {break;}ans += 1;let sub = v ;let x = pos(sub);let del = value_pos[x].range((sub - dp[x], 0)..).cloned().collect::<Vec<_>>();for (v, p) in del {value_pos[x].remove(&(v, p));pos_value[x].remove(&(p, v));let v = v + dp[x] - sub;if v > 0 {let x = pos(v);value_pos[x].insert((v - dp[x], p));pos_value[x].insert((p, v - dp[x]));}}for i in (x + 1)..w {while let Some(&(v, p)) = value_pos[i].iter().next() {if pos(v + dp[i]) == i {break;}value_pos[i].remove(&(v, p));pos_value[i].remove(&(p, v));let v = v + dp[i] - sub;if v > 0 {let x = pos(v);value_pos[x].insert((v - dp[x], p));pos_value[x].insert((p, v - dp[x]));}}dp[i] -= sub;}}println!("{}", ans);}fn main() {run();}