#853858 (Rust) No.1820 NandShift

• 問題: No.1820 NandShift
• ユーザー: koba-e964
• 提出日時: 2023-03-30 00:18:38
• 言語: Rust (1.83.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 2,245 bytes
• コンパイル時間: 12,872 ms
• コンパイル使用メモリ: 382,872 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-09-21 14:44:04
• 合計ジャッジ時間: 14,893 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 2
other	AC * 4 WA * 26

ソースコード

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
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 ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
// https://yukicoder.me/problems/no/1820 (3.5)
// [-1, -2, ..., -2^{M-1}] を作るのに M 回
// [~1, ~2, ..., ~2^{M-1}] を作るのに 2M 回
// 1 bit 調整するのに 2 回
// 合計 5M 回程度の操作で可能。
fn main() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        n: usize, m: usize,
        x: chars,
        _a: [chars; n],
    }
    let lim = 1_000_000_000;
    let mut k = 3 * m;
    for i in 0..m {
        if x[m - 1 - i] == '0' { k += 1; }
    }
    puts!("{}\n", k);
    puts!("2 {} {} {}\n", lim, lim, lim);
    for i in 1..m {
        puts!("1 {} {}\n", lim - i, lim - i + 1);
    }
    for i in 0..m - 1 { 
        puts!("2 {} {} {}\n", lim - i - m, lim - i - 1, lim - i - 1);
        puts!("2 {} {} {}\n", lim - i - m, lim - i, lim - i - m);
    }
    puts!("2 {} {} {}\n", lim - 2 * m + 1, lim - m + 1, lim - m + 1);
    puts!("2 0 0 {}\n", lim - 2 * m);
    for i in 0..m {
        if x[m - 1 - i] == '0' {
            puts!("2 0 0 {}\n", lim - m - i);
            puts!("2 0 0 0\n");
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX