#457591 (Rust) No.1017 Reiwa Sequence

• 問題: No.1017 Reiwa Sequence
• ユーザー: koba-e964
• 提出日時: 2020-04-03 22:05:23
• 言語: Rust (1.77.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 4,441 bytes
• コンパイル時間: 12,529 ms
• コンパイル使用メモリ: 383,532 KB
• 実行使用メモリ: 15,232 KB
• 最終ジャッジ日時: 2024-07-03 03:02:00
• 合計ジャッジ時間: 44,634 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 6,812 KB
testcase_01	AC	3 ms; 6,812 KB
testcase_02	AC	3 ms; 6,944 KB
testcase_03	AC	3 ms; 6,940 KB
testcase_04	AC	4 ms; 6,940 KB
testcase_05	AC	4 ms; 6,944 KB
testcase_06	AC	3 ms; 6,940 KB
testcase_07	AC	3 ms; 6,940 KB
testcase_08	AC	3 ms; 6,944 KB
testcase_09	AC	5 ms; 6,940 KB
testcase_10	AC	14 ms; 6,940 KB
testcase_11	AC	3 ms; 6,940 KB
testcase_12	AC	15 ms; 6,944 KB
testcase_13	AC	16 ms; 6,944 KB
testcase_14	AC	4 ms; 6,944 KB
testcase_15	AC	5 ms; 6,940 KB
testcase_16	AC	4 ms; 6,944 KB
testcase_17	AC	13 ms; 6,944 KB
testcase_18	AC	3 ms; 6,944 KB
testcase_19	AC	241 ms; 6,944 KB
testcase_20	AC	244 ms; 6,944 KB
testcase_21	AC	242 ms; 6,940 KB
testcase_22	AC	245 ms; 6,940 KB
testcase_23	AC	251 ms; 6,944 KB
testcase_24	AC	240 ms; 6,940 KB
testcase_25	AC	239 ms; 6,940 KB
testcase_26	AC	246 ms; 6,940 KB
testcase_27	WA	-
testcase_28	AC	108 ms; 6,944 KB
testcase_29	AC	15 ms; 6,944 KB
testcase_30	WA	-
testcase_31	AC	33 ms; 6,944 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	3 ms; 6,940 KB
testcase_35	AC	3 ms; 6,944 KB
testcase_36	AC	4 ms; 6,940 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	AC	33 ms; 11,776 KB
testcase_41	AC	33 ms; 11,716 KB
testcase_42	AC	31 ms; 11,476 KB
testcase_43	AC	34 ms; 11,584 KB
testcase_44	AC	31 ms; 11,776 KB
testcase_45	AC	31 ms; 11,648 KB
testcase_46	AC	32 ms; 11,468 KB
testcase_47	AC	32 ms; 11,480 KB
testcase_48	AC	32 ms; 10,996 KB
testcase_49	AC	42 ms; 15,232 KB
testcase_50	AC	21 ms; 7,808 KB
testcase_51	AC	4 ms; 6,944 KB
testcase_52	WA	-
testcase_53	WA	-

ソースコード

#[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);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/// Generates an Iterator over subsets of univ, in the descending order. 
/// Verified by: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3050308
struct SubsetIter { bits: Option<usize>, univ: usize }
impl Iterator for SubsetIter {
    type Item = usize;
    fn next(&mut self) -> Option<usize> {
        match self.bits {
            None => None,
            Some(bits) => {
                let ans = bits;
                self.bits =
                    if bits == 0 { None }
                else { Some((bits - 1) & self.univ) };
                Some(ans)
            }
        }
    }
}
fn subsets(univ: usize) -> SubsetIter {
    SubsetIter { bits: Some(univ), univ: univ }
}

const W: usize = 150_001;

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize,
        a: [usize; n],
    }
    let mut freq = vec![vec![]; W];
    for i in 0..n {
        freq[a[i]].push(i);
    }
    let mut ans = vec![0; n];
    macro_rules! emit {
        () => {
            puts!("Yes\n");
            for i in 0..n {
                puts!("{}{}", ans[i], if i + 1 == n { "\n" } else { " " });
            }
            return;
        }
    }
    for i in 1..W {
        if freq[i].len() >= 2 {
            ans[freq[i][0]] = i as i32;
            ans[freq[i][1]] = - (i as i32);
            emit!();
        }
    }
    let mut b = a.clone();
    b.sort();
    let mut ans_set = None;
    let m = min(17, b.len());
    let mut dp = vec![0; 1 << m];
    for bits in 0..1 << m {
        let mut sum = 0;
        for i in 0..m {
            if (bits & 1 << i) != 0 {
                sum += b[i] as i32;
            }
        }
        dp[bits] = sum;
    }
    'outer:
    for bits in 1..1 << m {
        for sub in subsets(bits) {
            let sum = dp[bits] - dp[sub] * 2;
            if sum == 0 {
                ans_set = Some((sub, bits - sub));
                break 'outer;
            }
        }
    }
    if let Some((s1, s2)) = ans_set {
        for i in 0..m {
            let idx = freq[b[i]][0];
            if (s1 & 1 << i) != 0 {
                ans[idx] = b[i] as i32;
            } else if (s2 & 1 << i) != 0 {
                ans[idx] = -(b[i] as i32);
            }
        }
        emit!();
    } else {
        puts!("No\n");
    }
}

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();
}