#719311 (Rust) No.1634 Sorting Integers (Multiple of K) Hard

• 問題: No.1634 Sorting Integers (Multiple of K) Hard
• ユーザー: koba-e964
• 提出日時: 2021-11-23 22:08:39
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 308 ms / 3,000 ms
• コード長: 2,924 bytes
• コンパイル時間: 14,636 ms
• コンパイル使用メモリ: 379,108 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-25 19:49:10
• 合計ジャッジ時間: 21,765 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	4 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	155 ms; 5,376 KB
testcase_06	AC	156 ms; 5,376 KB
testcase_07	AC	155 ms; 5,376 KB
testcase_08	AC	185 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	300 ms; 5,376 KB
testcase_12	AC	308 ms; 5,376 KB
testcase_13	AC	299 ms; 5,376 KB
testcase_14	AC	299 ms; 5,376 KB
testcase_15	AC	302 ms; 5,376 KB
testcase_16	AC	300 ms; 5,376 KB
testcase_17	AC	66 ms; 5,376 KB
testcase_18	AC	82 ms; 5,376 KB
testcase_19	AC	141 ms; 5,376 KB
testcase_20	AC	86 ms; 5,376 KB
testcase_21	AC	13 ms; 5,376 KB
testcase_22	AC	217 ms; 5,376 KB
testcase_23	AC	257 ms; 5,376 KB
testcase_24	AC	304 ms; 5,376 KB
testcase_25	AC	307 ms; 5,376 KB
testcase_26	AC	302 ms; 5,376 KB
testcase_27	AC	300 ms; 5,376 KB
testcase_28	AC	298 ms; 5,376 KB
testcase_29	AC	299 ms; 5,376 KB
testcase_30	AC	297 ms; 5,376 KB
testcase_31	AC	298 ms; 5,376 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
use std::collections::*;
// 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 ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($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; } }
}

fn dfs2(x: [i64; 9], a: i64, k: i64, ans: &mut HashMap<i64, i64>) {
    if x.iter().all(|&x| x == 0) {
        *ans.entry(a).or_insert(0) += 1;
        return;
    }
    for i in 0..9 {
        if x[i] > 0 {
            let mut y = x;
            y[i] -= 1;
            dfs2(y, (10 * a + i as i64 + 1) % k, k, ans);
        }
    }
}

fn all_perm(x: [i64; 9], k: i64) -> HashMap<i64, i64> {
    let mut ans = HashMap::new();
    dfs2(x, 0, k, &mut ans);
    ans
}

fn calc(hi: [i64; 9], lo: [i64; 9], bias: i64, k: i64) -> i64 {
    let fst = all_perm(hi, k);
    let snd = all_perm(lo, k);
    let mut ans = 0;
    for (k1, v) in fst {
        let k2 = (k - k1) * bias % k;
        ans += *snd.get(&k2).unwrap_or(&0) * v;
    }
    ans
}

fn dfs(v: usize, x: i64, c: &[i64], k: i64, picked: [i64; 9]) -> i64 {
    if v >= 9 {
        if x != 0 {
            return 0;
        }
        let mut rest = [0; 9];
        let mut bias = 1;
        for i in 0..9 {
            rest[i] = c[i] - picked[i];
            for _ in 0..picked[i] {
                bias *= 10;
            }
        }
        return calc(rest, picked, bias, k);
    }
    let mut ans = 0;
    for i in 0..min(x, c[v]) + 1 {
        let mut q = picked;
        q[v] = i;
        ans += dfs(v + 1, x - i, c, k, q);
    }
    ans
}

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() {
    input! {
        n: i64, k: i64,
        c: [i64; 9],
    }
    println!("{}", dfs(0, n / 2, &c, k, [0; 9]));
}