Submission details
Task:Tikut
Sender:viiviP
Submission time:2026-08-12 21:14:11 +0300
Language:C++ (C++17)
Status:READY
Result:20
Feedback
subtaskverdictscore
#10
#2ACCEPTED8
#3ACCEPTED12
#40
#50
#60
Test results
testverdicttimesubtask
#1ACCEPTED0.00 s1, 3, 4, 5, 6details
#20.00 s1, 4, 5, 6details
#30.00 s1, 4, 5, 6details
#40.00 s1, 4, 5, 6details
#5ACCEPTED0.00 s2, 5, 6details
#6ACCEPTED0.00 s2, 5, 6details
#7ACCEPTED0.00 s3, 5, 6details
#8ACCEPTED0.01 s3, 5, 6details
#9ACCEPTED0.00 s3, 5, 6details
#10ACCEPTED0.00 s3, 5, 6details
#11ACCEPTED0.00 s3, 5, 6details
#120.00 s4, 5, 6details
#130.00 s4, 5, 6details
#140.00 s4, 5, 6details
#150.00 s4, 5, 6details
#160.00 s5, 6details
#170.00 s5, 6details
#180.00 s5, 6details
#190.00 s5, 6details
#200.02 s6details
#210.01 s6details
#220.02 s6details

Compiler report

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

Code

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

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m;
    cin >>n>>m;
    vector<int>a(n);
    
    for (int i = 0; i<n;i++) {
        cin >>a[i];
    }


    if (m<=2) {
        sort(a.begin(), a.end());
        vector<int> b(a);
        vector<int>c(a);
    
        int mx = a.back();
        a.pop_back();
        a.push_back(mx/2);
        a.push_back(mx/2 + (mx%2==1));
        sort(a.begin(), a.end());
        cout <<a.back()-a[0]<<" ";
        if (m==2) {
            int ans = 1e9;
            int mx = c.back();
            c.pop_back();
            c.push_back(mx/3);
            c.push_back(mx/3 + (mx%3 != 0));
            sort(c.begin(), c.end());
            ans =c.back() - c[0];
        
            if (n>=2) {
                int mx = b.back();
                b.pop_back();
                int mn = b.back();
                b.pop_back();
                b.push_back(mx/2);
                b.push_back(mx/2 + (mx%2==1));
                
                b.push_back(mn/2);
                b.push_back(mn/2 + (mn%2==1));
                sort(b.begin(), b.end());
        
                ans = min(ans, b.back()-b[0]);
                
            }
            cout <<ans<<" ";
        }
    } else {
        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 ";
            } else {
                cout <<"1 ";
            }
        } 
    
        k = s[2];
        for (int i = 1; i<=k;i++) {
            //cout <<"noo\n";
            s[2]--;
            if(s[2]) {
                cout <<"1 ";
            } else {
                cout <<"0 ";
            }
        }
    }
} 

Test details

Test 1

Subtask: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
1 1
6

correct output

user output

Test 2

Subtask: 1, 4, 5, 6

Verdict:

input
5 10
4 8 6 2 7

correct output
5 4 2 2 2 1 1 1 1 1 

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 3

Subtask: 1, 4, 5, 6

Verdict:

input
5 10
5 5 8 6 7

correct output
3 3 2 3 2 2 1 1 1 2 

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 4

Subtask: 1, 4, 5, 6

Verdict:

input
5 10
8 7 9 6 10

correct output
4 4 3 3 2 2 1 2 2 1 

user output
(empty)

Error:
*** stack smashing detected ***: terminated

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 ...

correct output
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

user output
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

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 ...

correct output
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

user output
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

Test 7

Subtask: 3, 5, 6

Verdict: ACCEPTED

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

correct output
994 994 

user output
994 994 

Test 8

Subtask: 3, 5, 6

Verdict: ACCEPTED

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

correct output
498 496 

user output
498 496 

Test 9

Subtask: 3, 5, 6

Verdict: ACCEPTED

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

correct output
500 500 

user output
500 500 

Test 10

Subtask: 3, 5, 6

Verdict: ACCEPTED

input
1000 2
996 1000 998 998 999 997 997 9...

correct output
500 500 

user output
500 500 

Test 11

Subtask: 3, 5, 6

Verdict: ACCEPTED

input
1000 2
501 501 501 501 501 501 501 50...

correct output
1 168 

user output
1 168 

Test 12

Subtask: 4, 5, 6

Verdict:

input
100 200
145 136 74 83 73 36 196 115 11...

correct output
194 190 189 183 182 181 181 17...

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 13

Subtask: 4, 5, 6

Verdict:

input
100 200
157 110 168 155 192 107 146 15...

correct output
95 96 96 95 93 94 94 94 90 91 ...

user output
(empty)

Feedback: Output is shorter than expected

Test 14

Subtask: 4, 5, 6

Verdict:

input
50 200
137 118 160 118 146 160 140 18...

correct output
98 98 98 96 90 91 88 88 84 86 ...

user output
(empty)

Feedback: Output is shorter than expected

Test 15

Subtask: 4, 5, 6

Verdict:

input
100 200
147 174 186 148 155 128 158 18...

correct output
99 99 98 98 97 97 96 96 95 95 ...

user output
(empty)

Feedback: Output is shorter than expected

Test 16

Subtask: 5, 6

Verdict:

input
1000 2000
928772177 816188227 216592201 ...

correct output
991676844 990940224 990685481 ...

user output
(empty)

Test 17

Subtask: 5, 6

Verdict:

input
1000 2000
665759876 597950008 615453266 ...

correct output
498801198 498681904 498504321 ...

user output
(empty)

Test 18

Subtask: 5, 6

Verdict:

input
500 2000
683288817 784230412 626685186 ...

correct output
497667621 498434895 495465990 ...

user output
(empty)

Test 19

Subtask: 5, 6

Verdict:

input
1000 2000
666667000 809309500 571572000 ...

correct output
499499500 499249250 498999000 ...

user output
(empty)

Test 20

Subtask: 6

Verdict:

input
100000 200000
861772559 734298084 983382252 ...

correct output
499973914 499985299 499985141 ...

user output
(empty)

Test 21

Subtask: 6

Verdict:

input
30000 200000
691834579 617419813 514778075 ...

correct output
499967533 499976270 499969810 ...

user output
(empty)

Test 22

Subtask: 6

Verdict:

input
100000 200000
820255000 960780000 741965000 ...

correct output
499995000 499992500 499990000 ...

user output
(empty)