結果

問題 No.1017 Reiwa Sequence
ユーザー fukafukatani
提出日時 2020-04-03 23:07:28
言語 Rust
(1.83.0 + proconio)
結果
TLE  
実行時間 -
コード長 2,861 bytes
コンパイル時間 12,059 ms
コンパイル使用メモリ 405,740 KB
実行使用メモリ 294,332 KB
最終ジャッジ日時 2024-07-03 05:43:29
合計ジャッジ時間 35,300 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 42 TLE * 8
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}
fn yes(a: &Vec<i64>) {
    println!("Yes");
    for &num in a.iter().take(a.len() - 1) {
        print!("{} ", num);
    }
    println!("{}", a[a.len() - 1]);
}

fn main() {
    let n = read::<usize>();
    let a = read_vec::<usize>();

    let mut poses = vec![vec![]; 150001];
    for (i, &num) in a.iter().enumerate() {
        poses[num].push(i);
    }

    for i in 0..150001 {
        if poses[i].len() >= 2 {
            let mut answers = vec![0; n];
            answers[poses[i][0]] = i as i64;
            answers[poses[i][1]] = -(i as i64);
            yes(&answers);
            return;
        }
    }

    let max_search = 20;
    let mut cand_pos = vec![];
    let mut cand_num = vec![];
    for i in 0..150001 {
        if poses[i].len() == 1 {
            cand_num.push(i as i64);
            cand_pos.push(poses[i][0]);
        }
        if cand_num.len() == max_search {
            break;
        }
    }

    let mut dp = HashSet::new();
    let mut from = HashMap::new();

    for i in 0..cand_num.len() {
        let clone = dp.clone();
        for num in clone {
            if !dp.contains(&(cand_num[i] + num)) {
                from.insert(cand_num[i] + num, (Some(num), i, 1));
                dp.insert(cand_num[i] + num);
            }
            if !dp.contains(&(-cand_num[i] + num)) {
                from.insert(-cand_num[i] + num, (Some(num), i, -1));
                dp.insert(-cand_num[i] + num);
            }
        }
        if !dp.contains(&cand_num[i]) {
            dp.insert(cand_num[i]);
            from.insert(cand_num[i], (None, i, 1));
        }
        if !dp.contains(&(-cand_num[i])) {
            dp.insert(-cand_num[i]);
            from.insert(-cand_num[i], (None, i, -1));
        }
    }
    if dp.contains(&0) {
        let mut cur = 0;
        let mut answers = vec![0; n];
        loop {
            let (prev, idx, sign) = from[&cur];
            let i = cand_pos[idx];
            answers[i] = a[i] as i64 * sign;
            if let Some(p) = prev {
                cur = p;
            } else {
                break;
            }
        }
        yes(&answers);
    } else {
        println!("No");
    }
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
0