#908325 (Rust) No.1633 Sorting Integers (Multiple of 2^K)

• 問題: No.1633 Sorting Integers (Multiple of 2^K)
• ユーザー: koba-e964
• 提出日時: 2023-08-26 18:25:38
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 36 ms / 2,000 ms
• コード長: 3,026 bytes
• コンパイル時間: 12,881 ms
• コンパイル使用メモリ: 378,704 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-07 13:56:52
• 合計ジャッジ時間: 15,013 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
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	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	1 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	1 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	31 ms; 5,376 KB
testcase_24	AC	34 ms; 5,376 KB
testcase_25	AC	36 ms; 5,376 KB
testcase_26	AC	30 ms; 5,376 KB
testcase_27	AC	32 ms; 5,376 KB
testcase_28	AC	27 ms; 5,376 KB
testcase_29	AC	32 ms; 5,376 KB
testcase_30	AC	28 ms; 5,376 KB
testcase_31	AC	32 ms; 5,376 KB
testcase_32	AC	21 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	1 ms; 5,376 KB
testcase_35	AC	3 ms; 5,376 KB
testcase_36	AC	1 ms; 5,376 KB
testcase_37	AC	2 ms; 5,376 KB
testcase_38	AC	13 ms; 5,376 KB
testcase_39	AC	2 ms; 5,376 KB
testcase_40	AC	1 ms; 5,376 KB
testcase_41	AC	9 ms; 5,376 KB
testcase_42	AC	1 ms; 5,376 KB
testcase_43	AC	2 ms; 5,376 KB
testcase_44	AC	14 ms; 5,376 KB
testcase_45	AC	5 ms; 5,376 KB
testcase_46	AC	1 ms; 5,376 KB
testcase_47	AC	1 ms; 5,376 KB

コンパイルメッセージ

warning: unused macro definition: `puts`
  --> src/main.rs:85:18
   |
85 |     macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
   |                  ^^^^
   |
   = note: `#[warn(unused_macros)]` on by default

warning: unused import: `Write`
 --> src/main.rs:5:15
  |
5 | use std::io::{Write, BufWriter};
  |               ^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused variable: `out`
  --> src/main.rs:84:13
   |
84 |     let mut out = BufWriter::new(out.lock());
   |             ^^^ help: if this is intentional, prefix it with an underscore: `_out`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
  --> src/main.rs:84:9
   |
84 |     let mut out = BufWriter::new(out.lock());
   |         ----^^^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

ソースコード

#[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; } }
}

fn rec(a: [usize; 9], n: usize, sum: i64, p2: i64, p10: i64) -> i64 {
    if n == 0 {
        return sum & -sum;
    }
    if sum & (p2 - 1) != 0 {
        let r = sum & (p2 - 1);
        return r & -r;
    }
    let mut ans = 0;
    let mut b = a;
    for i in 0..9 {
        if a[i] > 0 {
            b[i] -= 1;
            let val = rec(b, n - 1, sum + p10 * (i as i64 + 1), p2 * 2, p10 * 10);
            if ans < val {
                ans = val;
            }
            b[i] += 1;
        }
    }
    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() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    #[allow(unused)]
    macro_rules! putvec {
        ($v:expr) => {
            for i in 0..$v.len() {
                puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});
            }
        }
    }
    input! {
        n: usize,
        a: [usize; 9],
    }
    let mut aa = [0; 9];
    for i in 0..9 {
        aa[i] = a[i];
    }
    let ans = rec(aa, n, 0, 1, 1);
    println!("{}", (ans - 1).count_ones());
}