結果
問題 | No.2690 A present from B (Hard) |
ユーザー | 👑 eoeo |
提出日時 | 2024-03-16 14:04:34 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 260 ms / 2,000 ms |
コード長 | 14,552 bytes |
コンパイル時間 | 15,114 ms |
コンパイル使用メモリ | 401,488 KB |
実行使用メモリ | 12,312 KB |
最終ジャッジ日時 | 2024-09-30 04:47:18 |
合計ジャッジ時間 | 19,098 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,820 KB |
testcase_02 | AC | 1 ms
6,820 KB |
testcase_03 | AC | 0 ms
6,820 KB |
testcase_04 | AC | 1 ms
6,820 KB |
testcase_05 | AC | 1 ms
6,820 KB |
testcase_06 | AC | 259 ms
12,288 KB |
testcase_07 | AC | 260 ms
12,304 KB |
testcase_08 | AC | 258 ms
12,312 KB |
testcase_09 | AC | 7 ms
6,816 KB |
testcase_10 | AC | 7 ms
6,816 KB |
testcase_11 | AC | 6 ms
6,816 KB |
testcase_12 | AC | 1 ms
6,816 KB |
testcase_13 | AC | 1 ms
6,816 KB |
testcase_14 | AC | 1 ms
6,820 KB |
testcase_15 | AC | 1 ms
6,820 KB |
testcase_16 | AC | 1 ms
6,816 KB |
testcase_17 | AC | 219 ms
6,820 KB |
testcase_18 | AC | 116 ms
9,088 KB |
testcase_19 | AC | 79 ms
10,112 KB |
testcase_20 | AC | 216 ms
6,820 KB |
testcase_21 | AC | 71 ms
11,008 KB |
testcase_22 | AC | 53 ms
6,912 KB |
testcase_23 | AC | 114 ms
10,752 KB |
testcase_24 | AC | 132 ms
6,816 KB |
testcase_25 | AC | 51 ms
8,320 KB |
testcase_26 | AC | 167 ms
8,832 KB |
testcase_27 | AC | 143 ms
11,924 KB |
testcase_28 | AC | 145 ms
11,920 KB |
testcase_29 | AC | 145 ms
11,924 KB |
ソースコード
// ngtkanaさんのコードです(https://yukicoder.me/submissions/957805) use input::input_array; use input::input_vec; use std::cmp::Ordering; use std::collections::BTreeMap; fn main() { let [n, _m] = input_array::<usize, 2>(); let a = input_vec::<isize>(); let mut dist = BTreeMap::from_iter(vec![ (0, isize::MAX), (1, 0), (n as isize, n as isize - 1), (n as isize + 1, isize::MAX), ]); for &x1 in a.iter().rev() { let x2 = x1 + 1; lerp(&mut dist, x1); lerp(&mut dist, x2); match dist[&x1].cmp(&dist[&x2]) { Ordering::Equal => {} Ordering::Less => { let section = dist[&x1] - x1; let on_line = |&(&x, &y): &(&isize, &isize)| y == section + x; lerp(&mut dist, x1 - 1); *dist.get_mut(&x1).unwrap() += isize::from(dist[&(x1 - 1)] >= dist[&x1]); if let Some((&(mut x3), _)) = dist.range(x2 + 1..).next().filter(on_line) { while let Some((&x, _)) = dist.range(x3 + 1..).next().filter(on_line) { dist.remove(&x3); x3 = x; } lerp(&mut dist, x3 + 1); *dist.get_mut(&x3).unwrap() -= 1; } *dist.get_mut(&x2).unwrap() -= 1; } Ordering::Greater => { let section = dist[&x2] + x2; let on_line = |&(&x, &y): &(&isize, &isize)| y == section - x; lerp(&mut dist, x2 + 1); *dist.get_mut(&x2).unwrap() += isize::from(dist[&x2] <= dist[&(x2 + 1)]); if let Some((&(mut x0), _)) = dist.range(..x1).next_back().filter(on_line) { while let Some((&x, _)) = dist.range(..x0).next_back().filter(on_line) { dist.remove(&x0); x0 = x; } lerp(&mut dist, x0 - 1); *dist.get_mut(&x0).unwrap() -= 1; } *dist.get_mut(&x1).unwrap() -= 1; } } } println!( "{}", (2..=n) .map(|i| { lerp(&mut dist, i as isize); dist[&(i as isize)].to_string() }) .collect::<Vec<_>>() .join(" ") ); } fn lerp(map: &mut BTreeMap<isize, isize>, x: isize) { if !map.contains_key(&x) { let (&x0, &y0) = map.range(..=x).next_back().unwrap(); let (&x1, &y1) = map.range(x..).next().unwrap(); let tilt = (y1 - y0) / (x1 - x0); assert!(matches!(tilt, -1 | 0 | 1)); let y = y0 + tilt * (x - x0); map.insert(x, y); } } // input {{{ #[allow(dead_code)] mod input { use std::cell::Cell; use std::convert::TryFrom; use std::io::stdin; use std::io::BufRead; use std::io::BufReader; use std::io::Lines; use std::io::Stdin; use std::str::FromStr; use std::sync::Mutex; use std::sync::Once; type Server = Mutex<Lines<BufReader<Stdin>>>; static ONCE: Once = Once::new(); pub struct Lazy(Cell<Option<Server>>); unsafe impl Sync for Lazy {} fn line() -> String { static SYNCER: Lazy = Lazy(Cell::new(None)); ONCE.call_once(|| { SYNCER .0 .set(Some(Mutex::new(BufReader::new(stdin()).lines()))); }); unsafe { (*SYNCER.0.as_ptr()) .as_ref() .unwrap() .lock() .unwrap() .next() .unwrap() .unwrap() } } pub trait ForceFromStr: FromStr { fn force_from_str(s: &str) -> Self; } impl<T, E> ForceFromStr for T where T: FromStr<Err = E>, E: std::fmt::Debug, { fn force_from_str(s: &str) -> Self { s.parse().unwrap() } } pub fn input_array<T: ForceFromStr, const N: usize>() -> [T; N] where T: std::fmt::Debug, { <[_; N]>::try_from(input_vec()).unwrap() } pub fn input_vec<T: ForceFromStr>() -> Vec<T> { line() .split_whitespace() .map(T::force_from_str) .collect::<Vec<_>>() } pub fn input<T: ForceFromStr>() -> T { T::force_from_str(&line()) } } // }}} // lg {{{ #[allow(dead_code)] mod lg { use std::borrow::Borrow; use std::fmt; use std::iter::once; #[macro_export] macro_rules! lg { (@contents $head:expr $(, $tail:expr)*) => {{ $crate::__lg_internal!($head); $( eprint!(","); $crate::__lg_internal!($tail); )* eprintln!(); }}; ($($expr:expr),* $(,)?) => {{ eprint!("{}隨カ・ッ", line!()); $crate::lg!(@contents $($expr),*) }}; } #[doc(hidden)] #[macro_export] macro_rules! __lg_internal { ($value:expr) => {{ match $value { head => { eprint!( " {} = {}", stringify!($value), $crate::lg::__quiet(format!("{:?}", &head)) ); } } }}; } #[macro_export] macro_rules! rows { { $index_label:literal, $(@offset $offset:expr,)? $(@verticalbar $verticalbar:expr,)* $($(@$label:literal =>)? $values:expr),* $(,)? } => {{ #![allow(unused_assignments)] let mut rows = $crate::lg::Rows::default(); rows.line_number(line!()); $(rows.offset($offset);)? $(rows.verticalbar($verticalbar);)* rows.index_label($index_label); $({ let mut label = stringify!($values).to_string(); if label.starts_with("&") { label = label[1..].to_string(); } $({ let label_: &'static str = $label; label = label_.to_string(); })? rows.row(label, $values); })* eprintln!("{}", rows.to_string_table()); }}; } #[macro_export] macro_rules! table { { $(@$name:literal => )? $values:expr $(,)? } => {{ #![allow(unused_assignments)] let mut name = stringify!($values).to_string(); if name.starts_with("&") { name = name[1..].to_string(); } $({ let name_: &'static str = $name; name = name_.to_string(); })? let mut rows = $crate::lg::Rows::default(); rows.line_number(line!()); rows.table_name(name); #[allow(array_into_iter)] for (i, row) in $values.into_iter().enumerate() { rows.row(i.to_string(), row); } eprintln!("{}", rows.to_string_table()); }}; } #[doc(hidden)] pub fn __quiet(s: impl AsRef<str>) -> String { s.as_ref() .replace("340282366920938463463374607431768211455", "*") // u128 .replace("170141183460469231731687303715884105727", "*") // i128 .replace("18446744073709551615", "*") // u64 .replace("9223372036854775807", "*") // i64 .replace("-9223372036854775808", "*") // i64 .replace("4294967295", "*") // u32 .replace("2147483647", "*") // i32 .replace("-2147483648", "*") // i32 .replace("None", "*") .replace("Some", "") .replace("true", "#") .replace("false", ".") .replace(['"', '\''], "") } #[doc(hidden)] #[derive(Default)] pub struct Rows { line_number: String, index_label: String, offset: usize, verticalbars: Vec<usize>, table_name: String, rows: Vec<Row>, } impl Rows { pub fn line_number(&mut self, line_number: u32) -> &mut Self { self.line_number = format!("{}", line_number); self } pub fn index_label(&mut self, index_label: impl Into<String>) -> &mut Self { self.index_label = index_label.into(); self } pub fn offset(&mut self, offset: usize) -> &mut Self { self.offset = offset; self } pub fn verticalbar(&mut self, verticalbar: impl IntoIterator<Item = usize>) -> &mut Self { self.verticalbars.extend(verticalbar); self } pub fn table_name(&mut self, table_name: impl Into<String>) -> &mut Self { self.table_name = table_name.into(); self } pub fn row( &mut self, label: impl Into<String>, values: impl IntoIterator<Item = impl fmt::Debug>, ) -> &mut Self { self.rows.push(Row { label: label.into(), values: values .into_iter() .map(|value| __quiet(format!("{:?}", value))) .collect(), }); self } pub fn to_string_table(self) -> StringTable { let Self { line_number, index_label, offset, verticalbars, table_name, rows, } = self; let w = rows .iter() .map(|row| row.values.len()) .max() .unwrap_or_default(); let mut verticalbar_count = vec![0; w + 1]; for &v in &verticalbars { if (offset..=offset + w).contains(&v) { verticalbar_count[v - offset] += 1; } } StringTable { head: StringRow { label: format!( "{line_number}隨カ・ッ {table_name}{index_label}", index_label = if index_label.is_empty() { String::new() } else { format!("[{}]", index_label) } ), values: (offset..offset + w) .map(|index| index.to_string()) .collect(), }, body: rows .iter() .map(|row| StringRow { label: row.label.clone(), values: row.values.clone(), }) .collect(), verticalbar_count, } } } struct Row { label: String, values: Vec<String>, } #[doc(hidden)] pub struct StringTable { head: StringRow, body: Vec<StringRow>, verticalbar_count: Vec<usize>, } impl fmt::Display for StringTable { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { let Self { head, body, verticalbar_count, } = self; let w = body .iter() .map(|row| row.values.len()) .max() .unwrap_or_default(); let label_width = once(head.label.chars().count()) .chain(body.iter().map(|row| row.label.chars().count())) .max() .unwrap(); let value_width = (0..w) .map(|j| { once(j.to_string().len()) .chain( body.iter() .map(|row| row.values.get(j).map_or(0, |s| s.chars().count())), ) .max() .unwrap() }) .collect::<Vec<_>>(); // Heading gray(f)?; write!( f, "{}", head.to_string(label_width, &value_width, verticalbar_count, true) )?; resetln(f)?; // Body for row in body { write!( f, "{}", row.to_string(label_width, &value_width, verticalbar_count, false) )?; writeln!(f)?; } Ok(()) } } struct StringRow { label: String, values: Vec<String>, } impl StringRow { fn to_string( &self, label_width: usize, value_width: &[usize], varticalbars_count: &[usize], label_align_left: bool, ) -> String { let Self { label, values } = self; let w = value_width.len(); let mut s = String::new(); s.push_str(&if label_align_left { format!("{label:<label_width$} |") } else { format!("{label:^label_width$} |") }); for j in 0..w { let value_width = value_width[j]; s.push_str("|".repeat(varticalbars_count[j]).as_str()); if varticalbars_count[j] == 0 && j != 0 && value_width <= 1 { s.push(' '); } match values.get(j) { Some(value) => { s.push_str(&format!(" {value:>value_width$}",)); } None => { s.push_str(" ".repeat(value_width + 1).as_str()); } } } s } } const GRAY: &str = "\x1b[48;2;127;127;127;37m"; const RESET: &str = "\x1b[0m"; fn gray(f: &mut fmt::Formatter<'_>) -> fmt::Result { write!(f, "{GRAY}") } fn resetln(f: &mut fmt::Formatter<'_>) -> fmt::Result { writeln!(f, "{RESET}") } pub fn bools<B, I>(iter: I) -> String where B: Borrow<bool>, I: IntoIterator<Item = B>, { format!( "[{}]", iter.into_iter() .map(|b| ['.', '#'][usize::from(*(b.borrow()))]) .collect::<String>(), ) } } // }}}