Tikut

warning: unreachable statement
  --> input/code.rs:22:5
   |
20 |     exit(0);
   |     ------- any code following this expression is unreachable
21 |     
22 |     let mut l = t[(n - 1) as usize];
   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ unreachable statement
   |
   = note: `#[warn(unreachable_code)]` on by default

warning: unused variable: `s`
  --> input/code.rs:17:13
   |
17 |     let mut s: Vec<u32> = vec![0; n.try_into().unwrap()];
   |             ^ help: if this is intentional, prefix it with an underscore: `_s`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
  --> input/code.rs:17:9
   |
17 |     let mut s: Vec<u32> = vec![0; n.try_into().unwrap()];
   |         ----^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

warning: 3 warnings emitted

use std::{io::{BufRead, BufReader}, process::exit, cmp::Reverse};
fn main() {
    let mut input = BufReader::new(std::io::stdin());
    let mut line = "".to_string();
    input.read_line(&mut line).unwrap();
    let mut split = line.split_whitespace();
    let n: u32 = split.next().unwrap().parse().unwrap();
    let m: u32 = split.next().unwrap().parse().unwrap();
    input = BufReader::new(std::io::stdin());
    line = "".to_string();
    input.read_line(&mut line).unwrap();
    if n + m == 0{print!("0"); exit(0)}
    split = line.split_whitespace();
    let mut t: Vec<u32> = split.map(|x| x.parse::<u32>().unwrap()).collect();
    t.sort_by_key(|w| Reverse(*w));
    println!("{:?}", t);
    let mut s: Vec<u32> = vec![0; n.try_into().unwrap()];

    print!("{} ",0);
    exit(0);
    
    let mut l = t[(n - 1) as usize];
    for _i in 0..m as usize{
        for ii in 0..n as usize{
            if ii as u32 == n - 1 {s[ii] += 1; l = if l > lyhyin(t[ii], s[ii]) {lyhyin(t[ii], s[ii])} else {l}; break}
            if pisin(t[ii], s[ii]) > pisin(t[ii+1], s[ii+1]){
                s[ii] += 1;
                l = if l > lyhyin(t[ii], s[ii]) {lyhyin(t[ii], s[ii])} else {l};
                break
            }
        }
        print!("{} ",pisin(t[0], s[0]) - l)
    }
}

fn pisin(t: u32, s: u32) -> u32{
    return t/(s + 1) + t%(s+1)
}
fn lyhyin(t: u32, s: u32) -> u32{
    return t/(s + 1)
}

Test 1

Group: 1, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 2

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

Test 3

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

Test 4

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

Test 5

Group: 2, 5, 6

Verdict: WRONG ANSWER

Test 6

Group: 2, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 9

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 13

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 16

Group: 5, 6

Verdict: WRONG ANSWER

Test 17

Group: 5, 6

Verdict: WRONG ANSWER

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

Test 20

Group: 6

Verdict: WRONG ANSWER

Test 21

Group: 6

Verdict: WRONG ANSWER

Test 22

Group: 6

Verdict: WRONG ANSWER