Tikut

#include <bits/stdc++.h>
#define INF INT32_MAX/2 + 1;
using namespace std;

int N, M;

vector<vector<int>> generate_sequences(int l, int k) {
    if (l == 1) {
        if (k > 0) return {{k}};
        return {};
    }

    vector<vector<int>> sequences;
    for (int i = 1; i <= k - l + 1; i++){
        for (auto current: generate_sequences(l - 1, k - i)) {
            current.push_back(i);
            sequences.push_back(current);
        }
    }
    return sequences;
}

int main() {
    cin >> N >> M;

    int a;
    vector<int> pieces(N, 1);
    vector<int> s;
    vector<int> m(N);
    for (int _ = 0; _ < N; _++) {
        cin >> a;
        s.push_back(a);
    }
    sort(s.rbegin(), s.rend());
    int global_min = s.back();
    
    for (int i = 0; i < N; i++) m[i]=s[i];

    //for (auto i: s) cout << i << " ";cout << endl;
    
    int max_index, max_value, minmax, maxmin, d1, d2;
    int prev_d = INF;
    for (int k = 1; k <= M; k++) {
        // find the index of the two cuts maximizing min and minimizing max respectively
        minmax = maxmin = 0;
        for (int i = 0; i < N; i++) {
            if (m[i] > m[minmax]) minmax = i;
            if (s[i]*(pieces[maxmin] + 1) > s[maxmin]*(pieces[i] + 1)) maxmin = i;
        }

        // find max_value among the sticks after we minimize max.
        max_index = minmax ^ 1;
        max_value = (s[minmax]-1)/(pieces[minmax]+1) + 1;
        for (int i = 0; i < N; i++) {
            if (i == minmax) continue;
            if (m[i] >= m[max_index] and m[i] > max_value) {
                max_index = i;
                max_value = m[max_index];
            }
        }
        d1 = max_value - min(global_min, s[minmax]/(pieces[minmax]+1));

        // find max_value among the sticks after we minimize max.
        max_index = maxmin ^ 1;
        max_value = (s[maxmin]-1)/(pieces[maxmin]+1) + 1;
        for (int i = 0; i < N; i++) {
            if (i == maxmin) continue;
            if (m[i] >= m[max_index] and m[i] > max_value) {
                max_index = i;
                max_value = m[max_index];
            }
        }

        d2 = max_value - min(global_min, s[maxmin]/(pieces[maxmin]+1));

        if (d1 > d2) minmax = maxmin;
        if (prev_d > min(d1, d2)) prev_d = min(d1, d2);

        // otherwise we should try complete search to get out of local optimum trap.
        else {
            prev_d = min(d1, d2);
            for (auto pieces : generate_sequences(N, N+k)) {
                int max_val = 0;
                int min_val = INF;
                for (int i = 0; i < N; i++) {
                    max_val = max(max_val, (s[i]-1)/pieces[i] + 1);
                    min_val = min(min_val, s[i]/pieces[i]);
                }
                prev_d = min(prev_d, max_val-min_val);
            }
        }
        

        cout << prev_d << " ";

        // cut the piece
        pieces[minmax]++;
        m[minmax] = (s[minmax]-1)/pieces[minmax] + 1;
        global_min = min(global_min, s[minmax]/pieces[minmax]);

        
    }
    cout << "\n";
}

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: TIME LIMIT EXCEEDED

Test 6

Group: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3, 5, 6

Verdict: ACCEPTED

Test 9

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

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: ACCEPTED

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