提出 #44894515


ソースコード 拡げる

use std::collections::HashMap;

use proconio::input;

fn main() {
    input! {
        n: usize,
        a: [i64; n],
    };

    let b = a
        .iter()
        .copied()
        .enumerate()
        .map(|(j, a_j)| -a_j + j as i64)
        .collect::<Vec<i64>>();
    let mut map = HashMap::new();
    for b_j in b {
        *map.entry(b_j).or_insert(0) += 1;
    }

    let mut count = 0_usize;
    for (i, a_i) in a.iter().copied().enumerate() {
        if let Some(c) = map.get(&(a_i + i as i64)) {
            count += c;
        }
    }

    let ans = count;
    println!("{}", ans);
}

提出情報

提出日時
問題 E - This Message Will Self-Destruct in 5s
ユーザ bouzuya
言語 Rust (1.42.0)
得点 500
コード長 595 Byte
結果 AC
実行時間 40 ms
メモリ 13332 KiB

ジャッジ結果

セット名 Sample Subtask1
得点 / 配点 0 / 0 500 / 500
結果
AC × 3
AC × 52
セット名 テストケース
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt, sub1_21.txt, sub1_22.txt, sub1_23.txt, sub1_24.txt, sub1_25.txt, sub1_26.txt, sub1_27.txt, sub1_28.txt, sub1_29.txt, sub1_small_01.txt, sub1_small_02.txt, sub1_small_03.txt, sub1_small_04.txt, sub1_small_05.txt, sub1_small_06.txt, sub1_small_07.txt, sub1_small_08.txt, sub1_small_09.txt, sub1_small_10.txt, sub1_small_11.txt, sub1_small_12.txt, sub1_small_13.txt, sub1_small_14.txt, sub1_small_15.txt, sub1_small_16.txt, sub1_small_17.txt, sub1_small_18.txt, sub1_small_19.txt, sub1_small_20.txt
ケース名 結果 実行時間 メモリ
sample_01.txt AC 4 ms 2028 KiB
sample_02.txt AC 2 ms 2040 KiB
sample_03.txt AC 3 ms 2168 KiB
sub1_01.txt AC 29 ms 7792 KiB
sub1_02.txt AC 20 ms 7132 KiB
sub1_03.txt AC 40 ms 12948 KiB
sub1_04.txt AC 40 ms 13332 KiB
sub1_05.txt AC 17 ms 4876 KiB
sub1_06.txt AC 38 ms 12512 KiB
sub1_07.txt AC 12 ms 4844 KiB
sub1_08.txt AC 36 ms 12168 KiB
sub1_09.txt AC 16 ms 4744 KiB
sub1_10.txt AC 28 ms 6248 KiB
sub1_11.txt AC 22 ms 7900 KiB
sub1_12.txt AC 29 ms 9788 KiB
sub1_13.txt AC 13 ms 4100 KiB
sub1_14.txt AC 34 ms 9684 KiB
sub1_15.txt AC 6 ms 3028 KiB
sub1_16.txt AC 12 ms 3908 KiB
sub1_17.txt AC 35 ms 9680 KiB
sub1_18.txt AC 20 ms 6336 KiB
sub1_19.txt AC 29 ms 8700 KiB
sub1_20.txt AC 35 ms 9668 KiB
sub1_21.txt AC 11 ms 4096 KiB
sub1_22.txt AC 31 ms 9000 KiB
sub1_23.txt AC 32 ms 9608 KiB
sub1_24.txt AC 31 ms 9320 KiB
sub1_25.txt AC 32 ms 9496 KiB
sub1_26.txt AC 31 ms 9568 KiB
sub1_27.txt AC 16 ms 5472 KiB
sub1_28.txt AC 19 ms 7340 KiB
sub1_29.txt AC 33 ms 9544 KiB
sub1_small_01.txt AC 2 ms 2108 KiB
sub1_small_02.txt AC 2 ms 2112 KiB
sub1_small_03.txt AC 1 ms 2164 KiB
sub1_small_04.txt AC 2 ms 2108 KiB
sub1_small_05.txt AC 2 ms 2232 KiB
sub1_small_06.txt AC 2 ms 2140 KiB
sub1_small_07.txt AC 2 ms 2156 KiB
sub1_small_08.txt AC 2 ms 2184 KiB
sub1_small_09.txt AC 1 ms 1992 KiB
sub1_small_10.txt AC 2 ms 2104 KiB
sub1_small_11.txt AC 2 ms 1940 KiB
sub1_small_12.txt AC 1 ms 2156 KiB
sub1_small_13.txt AC 3 ms 2196 KiB
sub1_small_14.txt AC 1 ms 2060 KiB
sub1_small_15.txt AC 2 ms 2272 KiB
sub1_small_16.txt AC 2 ms 2164 KiB
sub1_small_17.txt AC 2 ms 2200 KiB
sub1_small_18.txt AC 2 ms 2044 KiB
sub1_small_19.txt AC 2 ms 2204 KiB
sub1_small_20.txt AC 2 ms 2116 KiB