Alitaulukot

warning: unused import: `std::collections::HashSet`
 --> input/code.rs:2:5
  |
2 | use std::collections::HashSet;
  |     ^^^^^^^^^^^^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused macro definition
 --> input/code.rs:4:1
  |
4 | / macro_rules! c_comp {
5 | |     ($a:expr,$b:expr,$c:expr) => {
6 | |         $a < $b && $b < $c
7 | |     };
8 | | }
  | |_^
  |
  = note: `#[warn(unused_macros)]` on by default

warning: value assigned to `dbreak` is never read
  --> input/code.rs:29:13
   |
29 |     let mut dbreak = false;
   |             ^^^^^^
   |
   = note: `#[warn(unused_assignments)]` on by default
   = help: maybe it is overwritten before being read?

warning: variable does not need to be mutable
  --> input/code.rs:25:9
   |
25 |     let mut ints:Vec<i32> = split.map(|t|{t.parse::<i32>().unwrap()}).collect();
   |         ----^^^^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

use std::io::{BufRead, BufReader};
use std::collections::HashSet;

macro_rules! c_comp {
    ($a:expr,$b:expr,$c:expr) => {
        $a < $b && $b < $c
    };
}

fn main() {
    let mut input = BufReader::new(std::io::stdin());
    let mut line;
    let mut split;

    line = "".to_string();
    input.read_line(&mut line).unwrap();
    split = line.split_whitespace();
    let n: i32 = split.next().unwrap().parse().unwrap();
    let k: i32 = split.next().unwrap().parse().unwrap();

    line = "".to_string();
    input.read_line(&mut line).unwrap();
    // println!("{:?}",line);
    split = line.split_whitespace();
    let mut ints:Vec<i32> = split.map(|t|{t.parse::<i32>().unwrap()}).collect();
    // println!("{:?}",ints);

    let mut c = 0;
    let mut dbreak = false;
    // let mut note:HashSet<[i32;2]> = HashSet::new();
    for i in 0..(n as usize) {
        dbreak = false;
        for j in (i+1)..((n+1) as usize) {
            // println!("{:?} {}–{}",ints[i..j].iter(), ints[i..j].iter().max().unwrap(), ints[i..j].iter().min().unwrap());
            if ints[i..j].iter().max().unwrap()-ints[i..j].iter().min().unwrap() <= k {
                c += 1
            } else {
                dbreak = true;
            }
        }
        if dbreak {break;}
    }
    
    println!("{}",c);
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2, 3

Verdict: WRONG ANSWER

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED