CSES - Datatähti 2025 alku

Submission details
Task:	Tikut
Sender:	viiviP
Submission time:	2026-08-14 16:47:13 +0300
Language:	C++ (C++20)
Status:	READY
Result:	27

Feedback
subtask	verdict	score
#1	ACCEPTED	7
#2	ACCEPTED	8
#3	ACCEPTED	12
#4	TIME LIMIT EXCEEDED	0
#5	TIME LIMIT EXCEEDED	0
#6	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	subtask
#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.00 s	2, 5, 6	details
#6	ACCEPTED	0.00 s	2, 5, 6	details
#7	ACCEPTED	0.00 s	3, 5, 6	details
#8	ACCEPTED	0.01 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	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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:53:13: warning: unused variable 'c' [-Wunused-variable]
   53 |         int c = 0;
      |             ^

Code

#include <iostream>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int n, m_limit;
vector<int>best;
vector<int> add(vector<int>a, int i, int leikkaukset) {
    int val = a.back();
    a.pop_back();

    for (int j = 0; j<leikkaukset- (val%leikkaukset); j++) {
        a.push_back(val/leikkaukset);
    } 
    for (int j = 0; j<val%leikkaukset; j++) {
        a.push_back(val/leikkaukset+1);
    } 
    sort(a.begin(), a.end());
    return a;
}

void haku(int m, vector<int>a) {
    int i = a.size()-1;
    best[m] = min(best[m], a.back() - a[0]);
    if (m<m_limit) { 
        for (int j = 1; j<=m_limit-m;j++) {
            haku(m+j, add(a, i, j+1));
        }
    }

}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    cin >>n>>m_limit;
    best.resize(m_limit+1, 1e6);
    vector<int>a(n);
    
    int mx = 0;
    for (int i = 0; i<n;i++) {
        cin >>a[i];
        mx = max(mx, a[i]);
    }
    if (mx<=3) {
        int s[4] = {0,0,0,0};
        
        for (int i = 0; i<n;i++) {
            s[a[i]] += 1;
        }
    
        int c = 0;
    
        int k = s[3];
        for (int i = 1; i<=k;i++) {
            s[2]++;
            s[3]--;
            if (s[3]) {
                cout <<"2\n";
            } else {
                cout <<"1\n";
            }
        } 
    
        k = s[2];
        for (int i = 1; i<=k;i++) {
            s[2]--;
            if(s[2]) {
                cout <<"1\n";
            } else {
                cout <<"0\n";
            }
        }
    } else {
        sort(a.begin(), a.end());
        haku(0, a);
        for (int i = 1; i<=m_limit;i++) {
            cout <<best[i]<<" ";
        }
    }
}

Test details

Test 1

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

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

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

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

Subtask: 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 ...` view save

Test 6

Subtask: 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 ...` view save

Test 7

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Compiler report

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