結果

問題 No.2025 Select $k$-th Submultiset
ユーザー koba-e964koba-e964
提出日時 2023-08-28 00:26:17
言語 Rust
(1.77.0)
結果
AC  
実行時間 1,346 ms / 2,000 ms
コード長 4,327 bytes
コンパイル時間 1,709 ms
コンパイル使用メモリ 161,708 KB
実行使用メモリ 16,732 KB
最終ジャッジ日時 2023-08-28 00:26:54
合計ジャッジ時間 34,790 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 122 ms
4,376 KB
testcase_03 AC 1,319 ms
16,664 KB
testcase_04 AC 1,294 ms
16,732 KB
testcase_05 AC 1,189 ms
14,952 KB
testcase_06 AC 996 ms
12,784 KB
testcase_07 AC 1,343 ms
16,676 KB
testcase_08 AC 1,193 ms
15,220 KB
testcase_09 AC 1,309 ms
16,096 KB
testcase_10 AC 1,295 ms
16,044 KB
testcase_11 AC 1,166 ms
14,520 KB
testcase_12 AC 1,346 ms
16,692 KB
testcase_13 AC 1,193 ms
15,372 KB
testcase_14 AC 1,257 ms
15,544 KB
testcase_15 AC 1,229 ms
15,560 KB
testcase_16 AC 1,242 ms
15,608 KB
testcase_17 AC 1,292 ms
15,820 KB
testcase_18 AC 1,078 ms
13,632 KB
testcase_19 AC 1,048 ms
12,992 KB
testcase_20 AC 1,085 ms
13,496 KB
testcase_21 AC 1,138 ms
14,084 KB
testcase_22 AC 1,130 ms
14,312 KB
testcase_23 AC 1,182 ms
14,928 KB
testcase_24 AC 1,135 ms
14,360 KB
testcase_25 AC 1 ms
4,380 KB
testcase_26 AC 1 ms
4,380 KB
testcase_27 AC 1 ms
4,380 KB
testcase_28 AC 1 ms
4,380 KB
testcase_29 AC 1 ms
4,376 KB
testcase_30 AC 1 ms
4,376 KB
testcase_31 AC 1 ms
4,380 KB
testcase_32 AC 2 ms
4,376 KB
testcase_33 AC 1 ms
4,376 KB
testcase_34 AC 1 ms
4,376 KB
testcase_35 AC 1 ms
4,376 KB
testcase_36 AC 2 ms
4,380 KB
testcase_37 AC 1 ms
4,380 KB
testcase_38 AC 1 ms
4,376 KB
testcase_39 AC 1 ms
4,380 KB
testcase_40 AC 1 ms
4,376 KB
testcase_41 AC 1 ms
4,380 KB
testcase_42 AC 1 ms
4,376 KB
testcase_43 AC 1 ms
4,380 KB
testcase_44 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// 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"));
}

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 MB
    let 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);
    }
}
0