CSES - Datatähti Open 2017 - Results
Submission details
Task:Program
Sender:bciobanu
Submission time:2017-01-22 14:14:05 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED37
#3ACCEPTED42
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.04 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.03 s1details
#6ACCEPTED0.04 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.19 s2details
#12ACCEPTED0.04 s2details
#13ACCEPTED0.03 s2details
#14ACCEPTED0.05 s2details
#15ACCEPTED0.04 s2details
#16ACCEPTED0.05 s2details
#17ACCEPTED0.18 s2details
#18ACCEPTED0.04 s2details
#19ACCEPTED0.03 s2details
#20ACCEPTED0.21 s2details
#21ACCEPTED0.43 s3details
#22ACCEPTED0.46 s3details
#23ACCEPTED0.43 s3details
#24ACCEPTED0.04 s3details
#25ACCEPTED0.04 s3details
#26ACCEPTED0.46 s3details
#27ACCEPTED0.04 s3details
#28ACCEPTED0.05 s3details
#29ACCEPTED0.43 s3details
#30ACCEPTED0.04 s3details

Code

#include <bits/stdc++.h>
#include <tr1/unordered_map>
#define SZ(x) ((int) (x).size())
using namespace std;

typedef long long int64;

int main(void) {
    const double TLE = clock() + 0.35 * CLOCKS_PER_SEC;
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    int64_t n; cin >> n;
    
    queue<int64_t> q;
    tr1::unordered_map<int64_t, int> mark;
    
    mark[n] = 0;
    q.push(n);
    while (not q.empty() 
                and mark.find(1) == mark.end()
                    and clock() < TLE) {
        
        const int64_t node = q.front();
        q.pop();
        int dist = mark[node] >> 1;
        
        if ((node & 1LL) == 0 && mark.find(node >> 1) == mark.end()) {
            q.push(node >> 1);
            mark[node / 2] = (dist + 1) << 1;
        }
        if (node >= 4 and mark.find(node - 3) == mark.end()) {
            q.push(node - 3);
            mark[node - 3] = ((dist + 1) << 1) | 1;
        }
    }
    
    if (mark.find(1) == mark.end()) {
        cout << "0\n";
        return 0;
    }
    
    cout << (mark[1] >> 1) + 1 << '\n';
    
    int64_t node = 1;
    while (node != n) {
        if (mark[node] & 1) {
            node = node + 3;
            cout << "ADD\n";
        } else {
            node = node << 1LL;
            cout << "MUL\n";
        }
    }
    cout << "END\n";
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
58

correct output
8
MUL
ADD
MUL
ADD
...

user output
8
MUL
ADD
MUL
ADD
...

Test 2

Group: 1

Verdict: ACCEPTED

input
72

correct output
0

user output
0

Test 3

Group: 1

Verdict: ACCEPTED

input
83

correct output
8
MUL
ADD
MUL
MUL
...

user output
8
MUL
ADD
MUL
MUL
...

Test 4

Group: 1

Verdict: ACCEPTED

input
53

correct output
8
ADD
MUL
ADD
MUL
...

user output
8
ADD
MUL
ADD
MUL
...

Test 5

Group: 1

Verdict: ACCEPTED

input
100

correct output
8
ADD
MUL
ADD
MUL
...

user output
8
ADD
MUL
ADD
MUL
...

Test 6

Group: 1

Verdict: ACCEPTED

input
64

correct output
6
ADD
MUL
MUL
MUL
...

user output
6
ADD
MUL
MUL
MUL
...

Test 7

Group: 1

Verdict: ACCEPTED

input
84

correct output
0

user output
0

Test 8

Group: 1

Verdict: ACCEPTED

input
60

correct output
0

user output
0

Test 9

Group: 1

Verdict: ACCEPTED

input
51

correct output
0

user output
0

Test 10

Group: 1

Verdict: ACCEPTED

input
77

correct output
9
ADD
ADD
MUL
ADD
...

user output
9
ADD
ADD
MUL
ADD
...

Test 11

Group: 2

Verdict: ACCEPTED

input
941694

correct output
0

user output
0

Test 12

Group: 2

Verdict: ACCEPTED

input
905674

correct output
30
MUL
ADD
MUL
ADD
...

user output
30
MUL
ADD
MUL
ADD
...

Test 13

Group: 2

Verdict: ACCEPTED

input
908426

correct output
29
ADD
MUL
ADD
MUL
...

user output
29
ADD
MUL
ADD
MUL
...

Test 14

Group: 2

Verdict: ACCEPTED

input
960500

correct output
31
ADD
ADD
MUL
MUL
...

user output
31
ADD
ADD
MUL
MUL
...

Test 15

Group: 2

Verdict: ACCEPTED

input
902101

correct output
27
MUL
ADD
MUL
ADD
...

user output
27
MUL
ADD
MUL
ADD
...

Test 16

Group: 2

Verdict: ACCEPTED

input
994208

correct output
27
ADD
ADD
MUL
MUL
...

user output
27
ADD
ADD
MUL
MUL
...

Test 17

Group: 2

Verdict: ACCEPTED

input
923538

correct output
0

user output
0

Test 18

Group: 2

Verdict: ACCEPTED

input
950287

correct output
24
MUL
ADD
MUL
ADD
...

user output
24
MUL
ADD
MUL
ADD
...

Test 19

Group: 2

Verdict: ACCEPTED

input
950516

correct output
29
ADD
ADD
MUL
MUL
...

user output
29
ADD
ADD
MUL
MUL
...

Test 20

Group: 2

Verdict: ACCEPTED

input
921882

correct output
0

user output
0

Test 21

Group: 3

Verdict: ACCEPTED

input
933942296856681219

correct output
0

user output
0

Test 22

Group: 3

Verdict: ACCEPTED

input
955775764385016720

correct output
0

user output
0

Test 23

Group: 3

Verdict: ACCEPTED

input
981578916796073406

correct output
0

user output
0

Test 24

Group: 3

Verdict: ACCEPTED

input
927875200723222396

correct output
94
MUL
ADD
MUL
MUL
...

user output
94
MUL
ADD
MUL
MUL
...

Test 25

Group: 3

Verdict: ACCEPTED

input
990125206148420558

correct output
84
ADD
MUL
ADD
MUL
...

user output
84
ADD
MUL
ADD
MUL
...

Test 26

Group: 3

Verdict: ACCEPTED

input
964804802247123102

correct output
0

user output
0

Test 27

Group: 3

Verdict: ACCEPTED

input
996610423667404231

correct output
96
MUL
ADD
MUL
ADD
...

user output
96
MUL
ADD
MUL
ADD
...

Test 28

Group: 3

Verdict: ACCEPTED

input
948665008088793691

correct output
86
MUL
ADD
MUL
ADD
...

user output
86
MUL
ADD
MUL
ADD
...

Test 29

Group: 3

Verdict: ACCEPTED

input
969397787818953279

correct output
0

user output
0

Test 30

Group: 3

Verdict: ACCEPTED

input
918471787211371085

correct output
90
ADD
MUL
ADD
MUL
...

user output
90
ADD
MUL
ADD
MUL
...