#1016121 (Rust) No.2918 Divide Applicants Fairly

• 問題: No.2918 Divide Applicants Fairly
• ユーザー: ArcAki
• 提出日時: 2024-10-08 10:35:55
• 言語: Rust (1.83.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 2,811 bytes
• コンパイル時間: 12,235 ms
• コンパイル使用メモリ: 402,236 KB
• 実行使用メモリ: 52,080 KB
• 最終ジャッジ日時: 2024-10-08 10:36:40
• 合計ジャッジ時間: 32,618 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 42 WA * 19

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
#[allow(unused_imports)]
use std::{collections::
          {HashSet, HashMap, BinaryHeap, VecDeque, BTreeSet, BTreeMap},
          mem::{swap},
          cmp::{Reverse, Ordering, PartialOrd, PartialEq},
          fmt::{Debug},
          time::Instant};
//#[allow(unused_imports)]
//use rand::{Rng, thread_rng, seq::{SliceRandom, IndexedRandom}};
use std::io::{Read, BufReader, stdin};
struct InputReader<R: Read> {
    bytes: std::iter::Peekable<std::io::Bytes<BufReader<R>>>,
}
impl<R: Read> InputReader<R> {
    fn new(reader: R) -> Self {
        let reader = BufReader::new(reader);
        let bytes = reader.bytes().peekable();
        Self { bytes }
    }
    fn next_token(&mut self) -> String {
        self.bytes
            .by_ref()
            .map(|r| r.unwrap() as char)
            .take_while(|c| !c.is_whitespace())
            .collect()
    }
}
macro_rules! input {
    ($reader:expr, $($r:tt)*) => {
        let mut next = || $reader.next_token();
        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, usize) => {
        $next().parse::<usize>().expect("Parse error")
    };
    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
fn main() {
    let stdin = stdin();
    let mut reader = InputReader::new(stdin.lock());
    input!{
        reader,
        n: usize,
        r: [usize; n],
    }
    let mut cnt = 0;
    for i in 0..n{
        if r[i] == 0{
            cnt += 1;
        }
    }
    if cnt>=2{println!("0"); return;}
    let d = 3_200_000;
    let mut flag = vec![0; 6_400_001];
    if r[0]!=0{
        flag[d+r[0]] = 1;
    }
    for i in 1..n{
        if r[i]==0{continue}
        let mut nf = flag.clone();
        nf[d+r[i]] = 1;
        for j in 0..=2*d{
            if flag[j] > 0{
                if r[i]+j <= 2*d{
                    nf[j+r[i]] |= flag[j] | 1;
                }
                if j >= r[i]{
                    nf[j-r[i]] = flag[j] | 2;
                }
            }
        }
        flag = nf;
    }
    for i in 0..=d{
        if (cnt > 0 && (flag[d+i]>0||flag[d-i]>0))||(flag[d+i]==3||flag[d-i]==3){
            println!("{}", i);
            return;
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX