CSES - Aalto Competitive Programming 2024 - wk5 - Wed - Results
Submission details
Task:Program
Sender:aalto2024f_002
Submission time:2024-10-02 17:54:02 +0300
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails

Code

#include <bits/stdc++.h>

using namespace std;

long long cost(long long current, map<long long, long long> &next) {

    if (current <= 0)
        return LONG_LONG_MAX;

    if (current == 1)
        return 0;

    if (current == 4) {
        next[4] = 1;
        return 1;
    }

    if (current == 7) {
        next[7] = 4;
        next[4] = 1;
        return 2;
    }

    if (current % 2 == 0) {
        long long rec = cost(current/2, next);
        if (rec == LONG_LONG_MAX)
            return rec;
    
        next[current] = current/2;
        return rec+1;
    }

    else {
        long long rec = cost((current-3)/2, next);
        next[current] = current-3;
        next[current-3] = (current-3)/2;
        if (rec == LONG_LONG_MAX)
            return rec;
        return rec + 2;
    }

}

int main() {

    long long target;
    cin >> target;

    map<long long, long long> next;

    long long steps = cost(target, next);

    if (steps == LONG_LONG_MAX) {
        cout << 0 << endl;
        return 0;
    }

    steps += 1;

    cout << steps << endl;

    vector<string> outputs;

    long long current = target;
    while (current != 1) {
        long long m = next[current];
        if (abs(m - current) == 3) {
            outputs.push_back("ADD");
        }
        else {
            outputs.push_back("MUL");
        }
        current = m;
    }

    for (int i = (int) outputs.size()-1; i >= 0; i--) {
        cout << outputs[i] << endl;
    }

    cout << "END" << endl;
    return 0;

}

Test details

Test 1

Verdict: ACCEPTED

input
58

correct output
8
MUL
ADD
MUL
ADD
...

user output
8
MUL
ADD
MUL
ADD
...

Test 2

Verdict: ACCEPTED

input
72

correct output
0

user output
0

Test 3

Verdict: ACCEPTED

input
83

correct output
8
MUL
ADD
MUL
MUL
...

user output
8
MUL
ADD
MUL
MUL
...

Test 4

Verdict: ACCEPTED

input
53

correct output
8
ADD
MUL
ADD
MUL
...

user output
8
ADD
MUL
ADD
MUL
...

Test 5

Verdict: ACCEPTED

input
100

correct output
8
ADD
MUL
ADD
MUL
...

user output
8
ADD
MUL
ADD
MUL
...

Test 6

Verdict: ACCEPTED

input
64

correct output
6
ADD
MUL
MUL
MUL
...

user output
6
ADD
MUL
MUL
MUL
...

Test 7

Verdict: ACCEPTED

input
84

correct output
0

user output
0

Test 8

Verdict: ACCEPTED

input
60

correct output
0

user output
0

Test 9

Verdict: ACCEPTED

input
51

correct output
0

user output
0

Test 10

Verdict: ACCEPTED

input
77

correct output
9
ADD
ADD
MUL
ADD
...

user output
9
ADD
ADD
MUL
ADD
...

Test 11

Verdict: ACCEPTED

input
941694

correct output
0

user output
0

Test 12

Verdict: ACCEPTED

input
905674

correct output
30
MUL
ADD
MUL
ADD
...

user output
30
MUL
ADD
MUL
ADD
...
Truncated

Test 13

Verdict: ACCEPTED

input
908426

correct output
29
ADD
MUL
ADD
MUL
...

user output
29
ADD
MUL
ADD
MUL
...
Truncated

Test 14

Verdict: ACCEPTED

input
960500

correct output
31
ADD
ADD
MUL
MUL
...

user output
31
ADD
ADD
MUL
MUL
...
Truncated

Test 15

Verdict: ACCEPTED

input
902101

correct output
27
MUL
ADD
MUL
ADD
...

user output
27
MUL
ADD
MUL
ADD
...
Truncated

Test 16

Verdict: ACCEPTED

input
994208

correct output
27
ADD
ADD
MUL
MUL
...

user output
27
ADD
ADD
MUL
MUL
...
Truncated

Test 17

Verdict: ACCEPTED

input
923538

correct output
0

user output
0

Test 18

Verdict: ACCEPTED

input
950287

correct output
24
MUL
ADD
MUL
ADD
...

user output
24
MUL
ADD
MUL
ADD
...
Truncated

Test 19

Verdict: ACCEPTED

input
950516

correct output
29
ADD
ADD
MUL
MUL
...

user output
29
ADD
ADD
MUL
MUL
...
Truncated

Test 20

Verdict: ACCEPTED

input
921882

correct output
0

user output
0

Test 21

Verdict: ACCEPTED

input
933942296856681219

correct output
0

user output
0

Test 22

Verdict: ACCEPTED

input
955775764385016720

correct output
0

user output
0

Test 23

Verdict: ACCEPTED

input
981578916796073406

correct output
0

user output
0

Test 24

Verdict: ACCEPTED

input
927875200723222396

correct output
94
MUL
ADD
MUL
MUL
...

user output
94
MUL
ADD
MUL
MUL
...
Truncated

Test 25

Verdict: ACCEPTED

input
990125206148420558

correct output
84
ADD
MUL
ADD
MUL
...

user output
84
ADD
MUL
ADD
MUL
...
Truncated

Test 26

Verdict: ACCEPTED

input
964804802247123102

correct output
0

user output
0

Test 27

Verdict: ACCEPTED

input
996610423667404231

correct output
96
MUL
ADD
MUL
ADD
...

user output
96
MUL
ADD
MUL
ADD
...
Truncated

Test 28

Verdict: ACCEPTED

input
948665008088793691

correct output
86
MUL
ADD
MUL
ADD
...

user output
86
MUL
ADD
MUL
ADD
...
Truncated

Test 29

Verdict: ACCEPTED

input
969397787818953279

correct output
0

user output
0

Test 30

Verdict: ACCEPTED

input
918471787211371085

correct output
90
ADD
MUL
ADD
MUL
...

user output
90
ADD
MUL
ADD
MUL
...
Truncated