結果

問題 No.1017 Reiwa Sequence
ユーザー koba-e964
提出日時 2020-04-03 21:47:13
言語 Rust
(1.83.0 + proconio)
結果
TLE  
実行時間 -
コード長 3,672 bytes
コンパイル時間 15,428 ms
コンパイル使用メモリ 379,064 KB
実行使用メモリ 10,880 KB
最終ジャッジ日時 2024-07-03 02:02:15
合計ジャッジ時間 30,956 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 15 TLE * 1 -- * 34
権限があれば一括ダウンロードができます

ソースコード

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

const W: usize = 150_001;

fn dfs(a: &[usize], v: usize, sum: i64, s1: &mut Vec<usize>, s2: &mut Vec<usize>)
       -> Option<(Vec<usize>, Vec<usize>)> {
    let n = a.len();
    if sum == 0 && !(s1.is_empty() && s2.is_empty()) {
        return Some((s1.clone(), s2.clone()));
    }
    if v >= n {
        return None;
    }
    let val = a[v] as i64;
    s1.push(v);
    let sub1 = dfs(a, v + 1, sum + val, s1, s2);
    if sub1.is_some() { return sub1; }
    s1.pop();
    s2.push(v);
    let sub2 = dfs(a, v + 1, sum - val, s1, s2);
    if sub2.is_some() { return sub2; }
    s2.pop();
    dfs(a, v + 1, sum, s1, s2)
}

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!();
        }
    }
    if let Some((s1, s2)) = dfs(&a, 0, 0, &mut vec![], &mut vec![]) {
        for v in s1 {
            ans[v] = a[v] as i32;
        }
        for v in s2 {
            ans[v] = -(a[v] 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();
}
0