CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Tikut
Sender:	Hattless
Submission time:	2024-11-07 13:48:23 +0200
Language:	C++ (C++17)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0
#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	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#3	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#4	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#5	TIME LIMIT EXCEEDED	--	2, 5, 6	details
#6	TIME LIMIT EXCEEDED	--	2, 5, 6	details
#7	TIME LIMIT EXCEEDED	--	3, 5, 6	details
#8	TIME LIMIT EXCEEDED	--	3, 5, 6	details
#9	TIME LIMIT EXCEEDED	--	3, 5, 6	details
#10	TIME LIMIT EXCEEDED	--	3, 5, 6	details
#11	TIME LIMIT EXCEEDED	--	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

Code

#include <bits/stdc++.h>
#define ln "\n"
using namespace std;
using ll = long long;
 
int main() {
    int n,m;
    int sum = 0;
 
    cin >> n >> m;
    multiset<int> s;
    for(int i = 0; i < n; i++) {
        int a;
        cin >> a;
        sum += a;
        s.insert(a);
    }
 
    for(int i = 1; i <= m; i++) {
        multiset<int> temp = s;
        int best = INT_MAX;
        int target = *temp.rbegin();
 
        while(target > 0) {
            for(int repeat = 0; repeat <= n; repeat++) {
                int cuts = i;
                multiset<int> final;
                int tempRep = repeat;
                multiset<int>::reverse_iterator last = temp.rend();
                for(auto it = temp.rbegin(); it != temp.rend(); it++) {
 
                    if(*it > target && cuts > 0) {
                        int left = 0;
 
                        for(int j = 2; j <= cuts+1; j++) {
                            int val = *it/j;
                            bool done = false;
                            left = *it % j;
                            int add = 0;
                            if(left > 0) add++;
                            if(*last == *it) {
                                if(tempRep == 0) {
                                    add = 0;
                                } else {
                                    tempRep--;
                                }
                            }
                            if(val + add <= target || j == cuts+1) {
                                done = true;
                                cuts -= (j-1);
                                vector<int> base;
                                for(int v = 0; v < j; v++) base.push_back(val);
 
                                while(left > 0) {
                                    for(int v = 0; v < (j+1);v++) {
                                        base[v]++;
                                        left--; 
                                        if(left == 0) break;
                                    }
                                }
 
                                for(int g:base) {
                                    final.insert(g);
                                }
                            }
                            if(done) break;
                        }
                    } else {
 
                        final.insert(*it);
                    }
                    last = it;
                }
 
                if(cuts == 0) {
                    best = min(best,*final.rbegin()-*final.begin());
                } else {
                    for(int j =1 ; j <= cuts; j++) {
                        auto biggest = final.end();
                        biggest--;
                        int val = *biggest;
                        final.erase(biggest);
                        final.insert(val/2);
                        if(val % 2 == 1) final.insert((val/2)+1);
                        else final.insert(val/2);
                    }
                    best = min(best,*final.rbegin()-*final.begin());
 
                }
            }
            target--;
        }
        cout << best << " ";
    }
}

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: WRONG ANSWER

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

Test 3

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

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

Test 4

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

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

Test 5

Group: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

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

Test 6

Group: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

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

Test 7

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

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

correct output
`994 994` view save

user output
(empty)

Test 8

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

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

correct output
`498 496` view save

user output
(empty)

Test 9

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

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

correct output
`500 500` view save

user output
(empty)

Test 10

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

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

correct output
`500 500` view save

user output
(empty)

Test 11

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

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

correct output
`1 168` view save

user output
(empty)

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

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