CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Alitaulukot
Sender:	xnor
Submission time:	2020-09-28 17:30:22 +0300
Language:	Rust
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.01 s	1, 2, 3	details
#2	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#3	WRONG ANSWER	0.01 s	1, 2, 3	details
#4	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#5	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#6	WRONG ANSWER	0.01 s	2, 3	details
#7	TIME LIMIT EXCEEDED	--	2, 3	details
#8	TIME LIMIT EXCEEDED	--	2, 3	details
#9	TIME LIMIT EXCEEDED	--	2, 3	details
#10	TIME LIMIT EXCEEDED	--	2, 3	details
#11	WRONG ANSWER	0.01 s	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	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 {
    if arr.len() < 2 {
        return arr.len() as u64;
    }

    if arr.len() == 2 {
        if (arr[0] - arr[1]).abs() <= k {
            return 3;
        } else {
            return 2;
        }
    }

    let mid = arr.len() / 2;
    let mut min = (arr[mid], mid);
    let mut max = (arr[mid], mid);
    let mut left = mid;
    let mut right = mid;

    while max.0 - min.0 <= k && (left > 0 || right < arr.len() - 1) {
        if mid - left < right - mid {
            while left > 0 && arr[left] >= min.0 && arr[left] <= max.0 {
                left -= 1;
            }
            if arr[left] < min.0 {
                min = (arr[left], left);
            }
            if arr[left] > max.0 {
                max = (arr[left], left);
            }
        } else {
            while right < arr.len() - 1 && arr[right] >= min.0 && arr[right] <= max.0 {
                right += 1;
            }
            if arr[right] < min.0 {
                min = (arr[right], right);
            }
            if arr[right] > max.0 {
                max = (arr[right], right);
            }
        }
    }

    let final_left = min.1.min(max.1);
    let final_right = min.1.max(max.1);
    let diff = (final_right - final_left) as u64;

    diff * diff + f(&arr[0..final_right], k) + f(&arr[final_left+1..arr.len()], k)
}

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

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
`91` view save

Test 2

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
`119` view save

user output
`202` view save

Test 4

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`4006` view save

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`5050` view save

user output
(empty)

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

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
`1071` view save

Test 7

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 8

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`2413` view save

user output
(empty)

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`1287776` view save

user output
(empty)

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`2001000` view save

user output
(empty)

Test 11

Group: 3

Verdict: WRONG ANSWER

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
`96607` view save

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`123292` view save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`4946886742` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`5000050000` view save

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`3750075000` view save

user output
(empty)

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)