CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Alitaulukot
Sender:	xnor
Submission time:	2020-09-28 21:44:42 +0300
Language:	Rust
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	11
#2	ACCEPTED	26
#3	ACCEPTED	63

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	2, 3	details
#7	ACCEPTED	0.01 s	2, 3	details
#8	ACCEPTED	0.01 s	2, 3	details
#9	ACCEPTED	0.01 s	2, 3	details
#10	ACCEPTED	0.01 s	2, 3	details
#11	ACCEPTED	0.01 s	3	details
#12	ACCEPTED	0.01 s	3	details
#13	ACCEPTED	0.01 s	3	details
#14	ACCEPTED	0.01 s	3	details
#15	ACCEPTED	0.01 s	3	details
#16	ACCEPTED	0.15 s	3	details
#17	ACCEPTED	0.15 s	3	details

Code

use std::io::{self, BufRead};

fn main() {
    let mut lines = io::BufReader::new(io::stdin()).lines();

    let line1 = lines.next().unwrap().unwrap();
    let line2 = lines.next().unwrap().unwrap();
    let mut line1 = line1.split_whitespace();
    let mut line2 = line2.split_whitespace();

    let n: i32 = line1.next().unwrap().parse().unwrap();
    let k: i32 = line1.next().unwrap().parse().unwrap();

    let mut arr = Vec::<i32>::new();
    for _ in 0..n {
        arr.push(line2.next().unwrap().parse().unwrap());
    }

    println!("{}", f(&arr, k));
}

fn f(arr: &[i32], k: i32) -> u64 {
    let segment_vals_min: Vec<_> = arr.chunks(32).map(|c| *c.iter().min().unwrap()).collect();
    let big_seg_vals_min: Vec<_> = segment_vals_min
        .chunks(32)
        .map(|c| *c.iter().min().unwrap())
        .collect();
    let segment_vals_max: Vec<_> = arr.chunks(32).map(|c| *c.iter().max().unwrap()).collect();
    let big_seg_vals_max: Vec<_> = segment_vals_max
        .chunks(32)
        .map(|c| *c.iter().max().unwrap())
        .collect();

    let mut min = arr[0];
    let mut max = arr[0];
    let mut tail = 0;
    let mut res = 1;
    for i in 1..arr.len() {
        if arr[i] < min {
            min = arr[i];
            while max - min > k {
                if arr[tail] == max {
                    max = -1;
                    if i - tail > 32 * 32 {
                        max = *big_seg_vals_max[tail / (32 * 32) + 1..i / (32 * 32)]
                            .iter()
                            .max()
                            .unwrap_or(&1_000_000_000);
                        for j in tail+1..=((tail / (32 * 32) + 1) * 32 * 32).min(i) {
                            if arr[j] > max {
                                max = arr[j];
                            }
                        }
                        for j in ((i / (32 * 32) - 1) * 32 * 32).max(tail + 1)..=i {
                            if arr[j] > max {
                                max = arr[j];
                            }
                        }
                    } else {
                        for j in tail+1..=i {
                            if arr[j] > max {
                                max = arr[j];
                            }
                        }
                    }
                }
                tail += 1;
            }
        }
        if arr[i] > max {
            max = arr[i];
            while max - min > k {
                if arr[tail] == min {
                    min = 1_000_000_001;
                    if i - tail > 32 * 32 {
                        min = *big_seg_vals_min[tail / (32 * 32) + 1..i / (32 * 32)]
                            .iter()
                            .min()
                            .unwrap_or(&1_000_000_000);
                        for j in tail+1..=((tail / (32 * 32) + 1) * 32 * 32).min(i) {
                            if arr[j] < min {
                                min = arr[j];
                            }
                        }
                        for j in ((i / (32 * 32) - 1) * 32 * 32).max(tail + 1)..=i {
                            if arr[j] < min {
                                min = arr[j];
                            }
                        }
                    } else {
                        for j in tail + 1..=i {
                            if arr[j] < min {
                                min = arr[j];
                            }
                        }
                    }
                }
                tail += 1;
            }
        }
        res += i - tail + 1;
    }

    res as u64
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5050` view save

user output
`5050` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 2 5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ...` view save

correct output
`317` view save

user output
`317` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 10 71 60 61 96 25 10 10 9 84 85 1...` view save

correct output
`119` view save

user output
`119` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 990000000 111122929 961821360 578238211 ...` view save

correct output
`4006` view save

user output
`4006` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 1000000000 553190572 453407680 667300705 ...` view save

correct output
`5050` view save

user output
`5050` view save

Test 6

Group: 2, 3

Verdict: ACCEPTED

input
`2000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`2001000` view save

user output
`2001000` view save

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
`2000 2 4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ...` view save

correct output
`6340` view save

user output
`6340` view save

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`2000 10 65 88 33 88 41 10 17 38 22 3 8...` view save

correct output
`2413` view save

user output
`2413` view save

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`2000 999000000 746120950 772769620 721488968 ...` view save

correct output
`1287776` view save

user output
`1287776` view save

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`2000 1000000000 621947980 510355354 756705418 ...` view save

correct output
`2001000` view save

user output
`2001000` view save

Test 11

Group: 3

Verdict: ACCEPTED

input
`100000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5000050000` view save

user output
`5000050000` view save

Test 12

Group: 3

Verdict: ACCEPTED

input
`100000 2 3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ...` view save

correct output
`317066` view save

user output
`317066` view save

Test 13

Group: 3

Verdict: ACCEPTED

input
`100000 10 10 3 6 3 43 60 5 48 15 27 86 4...` view save

correct output
`123292` view save

user output
`123292` view save

Test 14

Group: 3

Verdict: ACCEPTED

input
`100000 999990000 460235639 963048588 47270983 3...` view save

correct output
`4946886742` view save

user output
`4946886742` view save

Test 15

Group: 3

Verdict: ACCEPTED

input
`100000 1000000000 885457070 18257718 927615960 3...` view save

correct output
`5000050000` view save

user output
`5000050000` view save

Test 16

Group: 3

Verdict: ACCEPTED

input
`100000 50000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`3750075000` view save

user output
`3750075000` view save

Test 17

Group: 3

Verdict: ACCEPTED

input
`100000 50000 100000 99999 99998 99997 99996...` view save

correct output
`3750075000` view save

user output
`3750075000` view save

Datatähti 2021 alku

Alitaulukot

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Tasks

Submissions (xnor)