結果
問題 | No.2025 Select -th Submultiset |
ユーザー |
|
提出日時 | 2023-08-28 00:26:17 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 1,411 ms / 2,000 ms |
コード長 | 4,327 bytes |
コンパイル時間 | 15,008 ms |
コンパイル使用メモリ | 379,760 KB |
実行使用メモリ | 17,664 KB |
最終ジャッジ日時 | 2024-12-28 11:33:44 |
合計ジャッジ時間 | 46,566 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;use std::io::{Write, BufWriter};// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_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"));}trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }impl<T: PartialOrd> Change for T {fn chmax(&mut self, x: T) { if *self < x { *self = x; } }fn chmin(&mut self, x: T) { if *self > x { *self = x; } }}trait Bisect<T> {fn lower_bound(&self, val: &T) -> usize;fn upper_bound(&self, val: &T) -> usize;}impl<T: Ord> Bisect<T> for [T] {fn lower_bound(&self, val: &T) -> usize {let mut pass = self.len() + 1;let mut fail = 0;while pass - fail > 1 {let mid = (pass + fail) / 2;if &self[mid - 1] >= val {pass = mid;} else {fail = mid;}}pass - 1}fn upper_bound(&self, val: &T) -> usize {let mut pass = self.len() + 1;let mut fail = 0;while pass - fail > 1 {let mid = (pass + fail) / 2;if &self[mid - 1] > val {pass = mid;} else {fail = mid;}}pass - 1}}fn main() {// In order to avoid potential stack overflow, spawn a new thread.let stack_size = 104_857_600; // 100 MBlet thd = std::thread::Builder::new().stack_size(stack_size);thd.spawn(|| solve()).unwrap().join().unwrap();}fn solve() {let out = std::io::stdout();let mut out = BufWriter::new(out.lock());macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}macro_rules! putvec {($v:expr) => {for i in 0..$v.len() {puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});}}}input! {n: usize, l: usize,c: [usize; n],q: usize,k: [i128; q],}let mut dp = vec![vec![0i128; l + 1]; n + 1];let mut acc = vec![vec![0i128; l + 2]; n + 1];dp[n][0] = 1;for i in 1..l + 2 {acc[n][i] = 1;}for i in (0..n).rev() {for j in 0..l + 1 {let tmp = acc[i + 1][j + 1].wrapping_sub(acc[i + 1][max(j, c[i]) - c[i]]);dp[i][j] = tmp;acc[i][j + 1] = acc[i][j].wrapping_add(tmp);}}eprintln!("{:?}", dp);for mut k in k {if k > dp[0][l] {puts!("-1\n");continue;}let mut rem = l;let mut ans = vec![0; n];for i in 0..n {let lim = min(rem, c[i]);let margin = rem - lim;let idx = acc[i + 1].lower_bound(&(k + acc[i + 1][margin]));let now = min(idx - margin - 1, lim);ans[i] = lim - now;rem -= lim - now;k -= acc[i + 1][now + margin] - acc[i + 1][margin];// eprintln!("i = {}, now = {}, rem = {}, k = {}", i, now, rem, k);}assert_eq!(k, 1);putvec!(ans);}}