CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Tikut
Sender:	zli0122
Submission time:	2024-11-10 23:39:35 +0200
Language:	C++ (C++11)
Status:	READY
Result:	27

Feedback
group	verdict	score
#1	ACCEPTED	7
#2	ACCEPTED	8
#3	ACCEPTED	12
#4	WRONG ANSWER	0
#5	WRONG ANSWER	0
#6	WRONG ANSWER	0

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

Code

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

int N, M;
vector<int> S;

pair<int, int> solve_minmax(vector<int> pieces, vector<int> m, int global_min) {
    // returns the index of the piece to cut, and returns the new difference
    int minmax = 0;
    int max_index, max_value;
    for (int i = 0; i < N; i++) {
        if (m[i] > m[minmax]) minmax = i;
    }

    // find max_value among the sticks after we minimize max.
    max_index = (minmax == 0) ? 1 : 0;
    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] && m[i] > max_value) {
            max_index = i;
            max_value = m[max_index];
        }
    }
    return {minmax, max_value - min(global_min, S[minmax]/(pieces[minmax]+1))};
}

pair<int, int> solve_maxmin(vector<int> pieces, vector<int> m, int global_min) {    
    // returns the index of the piece to cut, and returns the new difference
    int maxmin = 0;
    int max_index, max_value;
    for (int i = 0; i < N; 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 = (maxmin == 0) ? 1 : 0;
    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] && m[i] > max_value) {
            max_index = i;
            max_value = m[max_index];
        }
    }
    return {maxmin, max_value - min(global_min, S[maxmin]/(pieces[maxmin]+1))};
}



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

    int a;
    vector<int> pieces_minmax(N, 1);
    vector<int> pieces_maxmin(N, 1);
    vector<int> m_minmax(N);
    vector<int> m_maxmin(N);
    for (int _ = 0; _ < N; _++) {
        cin >> a;
        S.push_back(a);
    }
    sort(S.rbegin(), S.rend());
    int min_minmax = S.back();
    int min_maxmin = S.back();

    for (int i = 0; i < N; i++) {
        m_minmax[i] = S[i];
        m_maxmin[i] = S[i];
    }

    int minmax, maxmin, d1, d2;
    for (int k = 1; k <= M; k++) {

        auto _ = solve_minmax(pieces_minmax, m_minmax, min_minmax);
        minmax = _.first; d1 = _.second;

        auto __ = solve_maxmin(pieces_maxmin, m_maxmin, min_maxmin);
        maxmin = __.first; d2 = __.second;

        if (d1 > d2) {
            cout << d2 << " ";
        } else cout << d1 << " ";

        // cut the piece
        pieces_minmax[minmax]++;
        m_minmax[minmax] = (S[minmax]-1)/pieces_minmax[minmax] + 1;
        min_minmax = min(min_minmax, S[minmax]/pieces_minmax[minmax]);

        // cut the piece
        pieces_maxmin[maxmin]++;
        m_maxmin[maxmin] = (S[maxmin]-1)/pieces_maxmin[maxmin] + 1;
        min_maxmin = min(min_maxmin, S[maxmin]/pieces_maxmin[maxmin]);
    }
    cout << "\n";
}

Test details

Test 1

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
`1 1 6` view save

correct output
`0` view save

user output
`0` view save

Test 2

Group: 1, 4, 5, 6

Verdict: ACCEPTED

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 2 2 2 1 1 1 1 1` view save

Test 3

Group: 1, 4, 5, 6

Verdict: ACCEPTED

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
`3 3 2 3 2 2 1 1 1 2` view save

Test 4

Group: 1, 4, 5, 6

Verdict: ACCEPTED

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
`4 4 3 3 2 2 1 2 2 1` view save

Test 5

Group: 2, 5, 6

Verdict: ACCEPTED

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

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

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

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

correct output
`498 496` view save

user output
`498 496` 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: ACCEPTED

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

correct output
`1 168` view save

user output
`1 168` view save

Test 12

Group: 4, 5, 6

Verdict: ACCEPTED

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
`194 190 189 183 182 181 181 17...` view save

Test 13

Group: 4, 5, 6

Verdict: WRONG ANSWER

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
`95 96 96 95 93 94 94 94 90 91 ...` view save

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

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
`98 98 98 96 90 91 88 88 84 86 ...` view save

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

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
`99 99 98 98 97 97 96 96 95 95 ...` view save

Test 16

Group: 5, 6

Verdict: ACCEPTED

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

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

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

Test 17

Group: 5, 6

Verdict: WRONG ANSWER

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

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

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

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

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

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

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

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

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

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

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

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

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