CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Tikut
Sender:	AH
Submission time:	2024-11-09 02:20:34 +0200
Language:	C++ (C++20)
Status:	READY
Result:	27

Feedback
group	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	group
#1	ACCEPTED	0.00 s	1, 3, 4, 5, 6	details
#2	ACCEPTED	0.02 s	1, 4, 5, 6	details
#3	ACCEPTED	0.02 s	1, 4, 5, 6	details
#4	ACCEPTED	0.24 s	1, 4, 5, 6	details
#5	ACCEPTED	0.01 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.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	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>
using namespace std;

typedef long long ll;
typedef vector<int> vi;

#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i,a,b) for (int i = a; i < b; i++)

int n, m, md=999, c1=0, c2=0, c3=0;
vector<int> v;;

void t1(int k, multiset<int> s, int cd, int ch) {
    if (ch!=0) {
        s.insert(ch);
        s.insert((*s.rbegin())-ch);
        s.erase(s.find(*s.rbegin()));
    }
    if (cd == k) {
        md = min(*s.rbegin()-*s.begin(), md);
        return;
    }
    FOR(i,0,(*s.rbegin())/2) {
        t1(k, s, cd+1, i+1);
    }
}

void t2() {
    FOR(k,1,m+1) {
        if (c1==0 && c2==0 && k<c3) {
            cout << "2 ";
        }
        else if (c1==0 && c2==0 && k>=c3 && k<2*c3) {
            cout << "1 ";
        }
        else if (c1==0 && c2==0 && k>=2*c3) {
            cout << "0 ";
        }
        else if (c1==0 && c3==0 && k<c2) {
            cout << "1 ";
        }
        else if (c1==0 && c3==0 && k>=c2) {
            cout << "0 ";
        }
        else if (c3==0 && k<c2) {
            cout << "1 ";
        }
        else if (c3==0 && k>=c2) {
            cout << "0 ";
        }
        else if (c1==0 && k<c3) {
            cout << "2 ";
        }
        else if (c1==0 && k<2*c3+c2) {
            cout << "1 ";
        }
        else if (c1==0 && k>=2*c3+c2) {
            cout << "0 ";
        }
        else if (k<c3 && c1>0 && c3>0) {
            cout << "2 ";
        }
        else if (k>=c3 && k<2*c3+c2 && c1>0 && c3>0) {
            cout << "1 ";
        }
        else if (k>=2*c3+c2 && c1>0 && c3>0) {
            cout << "0 ";
        }
    }
}

void t3() {
    sort(v.begin(), v.end());
    if (n==1) {
        if (v.back()%2==0) {
            cout << "0";
        }
        else {
            cout << "1";
        }
    }
    else if ((v.back() - (v.back() / 2)) > v.rbegin()[1]) {
        if (v.back() / 2 < v.front()) {
            cout << v.rbegin()[1] - (v.back() / 2);
        }
        else {
            cout << (v.back() - (v.back() / 2)) - v.front();
        }
    }
    else if ((v.back() / 2) < v.front()) {
        cout << v.rbegin()[1] - (v.back() / 2);
    }
    else {
        cout << v.rbegin()[1] - v.front();
    }
    if (m==2) {
        if (n==1) {
            if (v.back()%3==0) {
                cout << " 0";
            }
            else {
                cout << " 1";
            }
        }
        else if ((v.back() - (v.back() / 2)) >= v.rbegin()[1]) {
            if (v.back() / 3 < v.front()) {
                cout << " " << v.rbegin()[1] - (v.back() / 3);
            }
            else {
                cout << " " << max((v.back() - v.back()/3) - ((v.back() - v.back()/3)/2) - v.front(), v.rbegin()[1] - v.front());
            }
        }
        else if (v.rbegin()[1] - (v.back() / 3) < (v.back() - (v.back() / 2) - v.rbegin()[1]/2)) {
            cout << " " << v.rbegin()[1] - (v.back() / 3);
        }
        else if (n==2) {
            cout << " " << (v.back() - (v.back() / 2)) - (v.rbegin()[1] / 2);
        }
        else if (v.rbegin()[1] / 2 < v.front()) {
            cout << " " << max((v.back() - (v.back() / 2)) - (v.rbegin()[1] / 2), v.rbegin()[2] - (v.rbegin()[1] / 2));
        }
        else {
            cout << " " << max((v.back() - (v.back() / 2)) - v.front(), v.rbegin()[2] - v.front());
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    multiset<int> s;
    bool it2 = true;
    cin >> n >> m;
    FOR(i,0,n) {
        int a;
        cin >> a;
        s.insert(a);
        v.push_back(a);
        if (a==1) c1++;
        else if (a==2) c2++;
        else if (a==3) c3++;
        else {
            it2 = false;
        }
    }
    if (m<=2) {
        t3();
    }
    else if (it2) {
        t2();
    }
    else {
        FOR(i,0,m) {
            t1(i+1, s, 0, 0);
            cout << md << " ";
            md=999;
        }
    }
}

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: 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 (AH)