CSES - Datatähti 2025 alku

Submission details
Task:	Tikut
Sender:	Saksunoob
Submission time:	2024-10-30 16:20:17 +0200
Language:	Rust (2021)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	WRONG ANSWER	0
#3	RUNTIME ERROR	0
#4	RUNTIME ERROR	0
#5	RUNTIME ERROR	0
#6	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	RUNTIME ERROR	0.00 s	1, 3, 4, 5, 6	details
#2	RUNTIME ERROR	0.00 s	1, 4, 5, 6	details
#3	RUNTIME ERROR	0.00 s	1, 4, 5, 6	details
#4	RUNTIME ERROR	0.00 s	1, 4, 5, 6	details
#5	WRONG ANSWER	0.00 s	2, 5, 6	details
#6	RUNTIME ERROR	0.00 s	2, 5, 6	details
#7	ACCEPTED	0.00 s	3, 5, 6	details
#8	WRONG ANSWER	0.02 s	3, 5, 6	details
#9	ACCEPTED	0.00 s	3, 5, 6	details
#10	ACCEPTED	0.00 s	3, 5, 6	details
#11	RUNTIME ERROR	0.00 s	3, 5, 6	details
#12	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#13	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#14	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#15	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#16	TIME LIMIT EXCEEDED	--	5, 6	details
#17	TIME LIMIT EXCEEDED	--	5, 6	details
#18	TIME LIMIT EXCEEDED	--	5, 6	details
#19	TIME LIMIT EXCEEDED	--	5, 6	details
#20	TIME LIMIT EXCEEDED	--	6	details
#21	TIME LIMIT EXCEEDED	--	6	details
#22	TIME LIMIT EXCEEDED	--	6	details

Compiler report

warning: unused variable: `n`
  --> input/code.rs:69:9
   |
69 |     let n: usize = n_str.parse().unwrap();
   |         ^ help: if this is intentional, prefix it with an underscore: `_n`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: 1 warning emitted

Code

use std::{cmp, collections::HashMap, io, usize};

fn calculate_primes(up_to: usize) -> Vec<usize> {
    let mut primes = vec![2];

    let mut check = 3;
    while check <= up_to {
        let mut i = 0;
        let mut valid = true;
        while primes[i]*primes[i] <= check {
            if check%primes[i]==0 {
                valid = false;
                break;
            }
            i+=1;
        }
        if valid {
            primes.push(check);
        }
        check += 2;
    }

    return primes;
}

fn max_length_difference(mut lengths: Vec<(usize, usize)>, cuts: usize) -> usize {
    let largest = lengths.pop().unwrap();
    if largest.1 > cuts {
        if cuts > 0 {
            return largest.0 - cmp::min(lengths.first().unwrap().0, largest.0/2);
        }
        return largest.0 - lengths.first().unwrap().0;
    }
    let primes = calculate_primes(largest.0/2);
    let mut min = usize::MAX;
    for p in primes {
        let mut new_lengths = lengths.clone();
        for i in (0..new_lengths.len()).rev() {
            if new_lengths[i].0 < largest.0-p {
                new_lengths.insert(i+1, (largest.0-p, largest.1));
                break;
            }
            else if new_lengths[i].0 == largest.0-p {
                new_lengths[i].1 += largest.1;
                break;
            }
        }
        for i in (0..new_lengths.len()).rev() {
            if new_lengths[i].0 < p {
                new_lengths.insert(i+1, (p, largest.1));
                break;
            }
            else if new_lengths[i].0 == p {
                new_lengths[i].1 += largest.1;
                break;
            }
        }
        min = cmp::min(min, max_length_difference(new_lengths, cuts-largest.1))
    }
    return min;
}

fn main() {
    let mut in_str = String::new();
    io::stdin().read_line(&mut in_str).unwrap();
    in_str = in_str.trim().to_string();
    let (n_str, m_str) = in_str.trim().split_once(' ').unwrap();

    let n: usize = n_str.parse().unwrap();
    let m: usize = m_str.parse().unwrap();

    let mut lengths_map: HashMap<usize, usize> = HashMap::new();

    let mut lengths_str = String::new();
    io::stdin().read_line(&mut lengths_str).unwrap();

    for l in lengths_str.split_whitespace() {
        let key = l.parse().unwrap();
        if lengths_map.contains_key(&key) {
            *lengths_map.get_mut(&key).unwrap() += 1;
        } else {
            lengths_map.insert(key, 1);
        }
    }

    let mut lengths_vec: Vec<(usize, usize)> = lengths_map.into_iter().collect();
    lengths_vec.sort_by_key(|k| k.0);

    for c in 1..=m {
        print!("{} ", max_length_difference(lengths_vec.clone(), c));
    }
    println!();

}

Test details

Test 1

Group: 1, 3, 4, 5, 6

Verdict: RUNTIME ERROR

input
`1 1 6` view save

correct output
`0` view save

user output
(empty)

Error:

thread 'main' panicked at 'called `Option::unwrap()` on a `None` value', input/code.rs:27:33
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace

Test 2

Group: 1, 4, 5, 6

Verdict: RUNTIME ERROR

input
`5 10 4 8 6 2 7` view save

correct output
`5 4 2 2 2 1 1 1 1 1` view save

user output
`5 4 3 2 2 1 1 1` view save

Error:

thread 'main' panicked at 'called `Option::unwrap()` on a `None` value', input/code.rs:32:44
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace

Test 3

Group: 1, 4, 5, 6

Verdict: RUNTIME ERROR

input
`5 10 5 5 8 6 7` view save

correct output
`3 3 2 3 2 2 1 1 1 2` view save

user output
`2 1` view save

Error:

thread 'main' panicked at 'called `Option::unwrap()` on a `None` value', input/code.rs:32:44
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace

Test 4

Group: 1, 4, 5, 6

Verdict: RUNTIME ERROR

input
`5 10 8 7 9 6 10` view save

correct output
`4 4 3 3 2 2 1 2 2 1` view save

user output
`3 2 1` view save

Error:

thread 'main' panicked at 'called `Option::unwrap()` on a `None` value', input/code.rs:32:44
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace

Test 5

Group: 2, 5, 6

Verdict: WRONG ANSWER

input
`1000 1071 3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ...` view save

correct output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

Test 6

Group: 2, 5, 6

Verdict: RUNTIME ERROR

input
`1000 1500 3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ...` view save

correct output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

Error:

thread 'main' panicked at 'called `Option::unwrap()` on a `None` value', input/code.rs:32:44
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace

Test 7

Group: 3, 5, 6

Verdict: ACCEPTED

input
`1000 2 15 710 210 347 398 66 318 277 ...` view save

correct output
`994 994` view save

user output
`994 994` view save

Test 8

Group: 3, 5, 6

Verdict: WRONG ANSWER

input
`1000 2 743 890 592 942 736 969 616 50...` view save

correct output
`498 496` view save

user output
`496 494` view save

Test 9

Group: 3, 5, 6

Verdict: ACCEPTED

input
`1000 2 987 968 920 994 988 918 914 95...` view save

correct output
`500 500` view save

user output
`500 500` view save

Test 10

Group: 3, 5, 6

Verdict: ACCEPTED

input
`1000 2 996 1000 998 998 999 997 997 9...` view save

correct output
`500 500` view save

user output
`500 500` view save

Test 11

Group: 3, 5, 6

Verdict: RUNTIME ERROR

input
`1000 2 501 501 501 501 501 501 501 50...` view save

correct output
`1 168` view save

user output
(empty)

Error:

thread 'main' panicked at 'called `Option::unwrap()` on a `None` value', input/code.rs:32:44
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace

Test 12

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 200 145 136 74 83 73 36 196 115 11...` view save

correct output
`194 190 189 183 182 181 181 17...` view save

user output
(empty)

Test 13

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 200 157 110 168 155 192 107 146 15...` view save

correct output
`95 96 96 95 93 94 94 94 90 91 ...` view save

user output
(empty)

Test 14

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`50 200 137 118 160 118 146 160 140 18...` view save

correct output
`98 98 98 96 90 91 88 88 84 86 ...` view save

user output
(empty)

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 200 147 174 186 148 155 128 158 18...` view save

correct output
`99 99 98 98 97 97 96 96 95 95 ...` view save

user output
(empty)

Test 16

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`1000 2000 928772177 816188227 216592201 ...` view save

correct output
`991676844 990940224 990685481 ...` view save

user output
(empty)

Test 17

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`1000 2000 665759876 597950008 615453266 ...` view save

correct output
`498801198 498681904 498504321 ...` view save

user output
(empty)

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`500 2000 683288817 784230412 626685186 ...` view save

correct output
`497667621 498434895 495465990 ...` view save

user output
(empty)

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`1000 2000 666667000 809309500 571572000 ...` view save

correct output
`499499500 499249250 498999000 ...` view save

user output
(empty)

Test 20

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 861772559 734298084 983382252 ...` view save

correct output
`499973914 499985299 499985141 ...` view save

user output
(empty)

Test 21

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`30000 200000 691834579 617419813 514778075 ...` view save

correct output
`499967533 499976270 499969810 ...` view save

user output
(empty)

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 820255000 960780000 741965000 ...` view save

correct output
`499995000 499992500 499990000 ...` view save

user output
(empty)

Datatähti 2025 alku

Tikut

Compiler report

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

Test 18

Test 19

Test 20

Test 21

Test 22

Tasks

Submissions (Saksunoob)