Tikut

warning: unused variable: `n`
  --> input/code.rs:62:9
   |
62 |     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

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

fn max_length_difference(mut lengths: Vec<(usize, usize)>, cuts: usize) -> usize {
    let largest = lengths.pop().unwrap();
    if largest.1 > cuts {
        if cuts > 0 {
            if lengths.len() == 0 {
                return largest.0 - largest.0/2;
            }
            return largest.0 - cmp::min(lengths.first().unwrap().0, largest.0/2);
        }
        if lengths.len() == 0 {
            return 0;
        }
        return largest.0 - lengths.first().unwrap().0;
    }
    let mut min = usize::MAX;
    for p in 1..=largest.0/2 {
        let mut new_lengths = lengths.clone();
        if new_lengths.len() == 0 {
            new_lengths.push((largest.0-p, largest.1));
        } else {
            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;
                }
                else if i==0 {
                    new_lengths.insert(0, (largest.0-p, largest.1));
                }
            }
        }
        
        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;
            }
            else if i==0 {
                new_lengths.insert(0, (p, largest.1));
            }
        }
        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 1

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

Test 2

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 3

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 4

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 5

Group: 2, 5, 6

Verdict: ACCEPTED

Test 6

Group: 2, 5, 6

Verdict: ACCEPTED

Test 7

Group: 3, 5, 6

Verdict: ACCEPTED

Test 8

Group: 3, 5, 6

Verdict: ACCEPTED

Test 9

Group: 3, 5, 6

Verdict: ACCEPTED

Test 10

Group: 3, 5, 6

Verdict: ACCEPTED

Test 11

Group: 3, 5, 6

Verdict: ACCEPTED

Test 12

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED