結果

問題 No.1017 Reiwa Sequence
ユーザー koba-e964koba-e964
提出日時 2020-04-03 22:03:00
言語 Rust
(1.77.0)
結果
TLE  
実行時間 -
コード長 5,166 bytes
コンパイル時間 1,430 ms
コンパイル使用メモリ 170,712 KB
実行使用メモリ 9,912 KB
最終ジャッジ日時 2023-09-16 01:41:12
合計ジャッジ時間 9,303 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
9,912 KB
testcase_01 AC 4 ms
4,400 KB
testcase_02 AC 3 ms
4,472 KB
testcase_03 AC 4 ms
4,468 KB
testcase_04 AC 4 ms
4,456 KB
testcase_05 AC 4 ms
4,468 KB
testcase_06 AC 3 ms
4,452 KB
testcase_07 AC 4 ms
4,400 KB
testcase_08 AC 4 ms
4,464 KB
testcase_09 AC 15 ms
4,480 KB
testcase_10 AC 34 ms
4,420 KB
testcase_11 AC 7 ms
4,480 KB
testcase_12 AC 119 ms
4,404 KB
testcase_13 AC 93 ms
4,504 KB
testcase_14 AC 14 ms
4,400 KB
testcase_15 AC 35 ms
4,400 KB
testcase_16 AC 14 ms
4,452 KB
testcase_17 AC 301 ms
4,448 KB
testcase_18 AC 13 ms
4,404 KB
testcase_19 TLE -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
testcase_49 -- -
testcase_50 -- -
testcase_51 -- -
testcase_52 -- -
testcase_53 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: constant `PRUNE` is never used
  --> Main.rs:92:7
   |
92 | const PRUNE: i64 = 300_000;
   |       ^^^^^
   |
   = note: `#[warn(dead_code)]` on by default

warning: function `dfs` is never used
  --> Main.rs:94:4
   |
94 | fn dfs(a: &[usize], v: usize, sum: i64, s1: &mut Vec<usize>, s2: &mut Vec<usize>)
   |    ^^^

warning: 2 warnings emitted

ソースコード

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

/// 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;
const PRUNE: i64 = 300_000;

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 sum < -PRUNE || sum > PRUNE {
        return None;
    }
    if v >= n {
        return None;
    }
    if sum < 0 {
        return dfs(a, v, -sum, s2, s1);
    }
    let val = a[v] as i64;
    s2.push(v);
    let sub2 = dfs(a, v + 1, sum - val, s1, s2);
    if sub2.is_some() { return sub2; }
    s2.pop();
    s1.push(v);
    let sub1 = dfs(a, v + 1, sum + val, s1, s2);
    if sub1.is_some() { return sub1; }
    s1.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!();
        }
    }
    let mut b = a.clone();
    b.sort();
    let mut ans_set = None;
    let m = min(17, b.len());
    'outer:
    for bits in 1..1 << m {
        for sub in subsets(bits) {
            let mut sum = 0;
            for i in 0..m {
                if (sub & 1 << i) != 0 {
                    sum += b[i] as i32;
                } else if (bits & 1 << i) != 0 {
                    sum -= b[i] as i32;
                }
            }
            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();
}
0