#721011 (Rust) No.1717 Levi-Civita Triangle

• 問題: No.1717 Levi-Civita Triangle
• ユーザー: koba-e964
• 提出日時: 2021-12-01 15:39:58
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 13 ms / 2,000 ms
• コード長: 1,667 bytes
• コンパイル時間: 13,231 ms
• コンパイル使用メモリ: 377,716 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-04 15:26:19
• 合計ジャッジ時間: 14,971 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

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

ソースコード

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
#[allow(unused_imports)]
use std::cmp::*;
// 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 ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
fn main() {
    input! {
        n: usize,
        a: [usize; 2 * n + 1],
    }
    let mut b = vec![0; 2 * n - 1];
    for i in 0..2 * n - 1 {
        if (a[i] + a[i + 2] + a[i + 1]) % 3 == 0 {
            b[i] = (a[i + 1] + 2 * a[i]) % 3;
        } 
    }
    if b[0] == 0 {
        println!("0");
        return;
    }
    for i in 0..2 * n - 1 {
        let t = if i % 2 == 1 {
            0
        } else if i % 4 == 0 {
            b[0]
        } else {
            3 - b[0]
        };
        if b[i] != t {
            println!("0");
            return;
        }
    }
    if n % 2 == 1 {
        println!("{}", b[0]);
    } else {
        println!("{}", 3 - b[0]);
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX