CSES - Datatähti Open 2017 - Results
Submission details
Task:Program
Sender:egor.lifar
Submission time:2017-01-21 20:49:21 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.04 s1details
#2ACCEPTED0.04 s1details
#30.04 s1details
#40.05 s1details
#50.04 s1details
#60.04 s1details
#7ACCEPTED0.04 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.05 s1details
#100.05 s1details
#11ACCEPTED0.05 s2details
#120.04 s2details
#130.04 s2details
#140.04 s2details
#150.05 s2details
#160.05 s2details
#17ACCEPTED0.04 s2details
#180.05 s2details
#190.05 s2details
#20ACCEPTED0.05 s2details
#21ACCEPTED0.04 s3details
#22ACCEPTED0.04 s3details
#23ACCEPTED0.05 s3details
#240.05 s3details
#250.05 s3details
#26ACCEPTED0.05 s3details
#270.05 s3details
#280.05 s3details
#29ACCEPTED0.05 s3details
#300.06 s3details

Code

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <cassert>
 
  
  
using namespace std;
  
  
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
  
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
  
/** Read */
  
static const int buf_size = 4096;
  
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len)
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    if (pos == len)
        return -1;
    return buf[pos++];
}
  
inline int readChar() {
    int c = getChar();
    while (c <= 32)
        c = getChar();
    return c;
}
  
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
  
/** Write */
  
static int write_pos = 0;
static char write_buf[buf_size];
  
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
  
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
  
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
  
inline void writeWord( const char *s ) {
    while (*s)
        writeChar(*s++);
}
  
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
  

#define prev prev228
#define left left228
#define right right228  
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
const int MAXN = 1000001;

long long n;
int prev[MAXN];
int dp[MAXN];


int main() {
    cin >> n;
    dp[1] = 0;
    prev[1] = 0;
    for (int i = 2; i < MAXN; i++) {
        dp[i] = MAXN;
        if (i % 2 == 1) {
            dp[i] = dp[i - 3] + 1;
            prev[i] = i - 3;
        } else {
            dp[i] = min(dp[i / 2] + 1, dp[i - 3] + 1);
            if (dp[i] == dp[i / 2] + 1) {
                prev[i] = i / 2;
            } else {
                prev[i] = i - 3;
            }
        }
    }
    vector<string> ans;
    while (n > 100000) {
        if (n % 2 == 1) {
            n -= 3;
            ans.push_back("ADD");
        } else {
            n >>= 1LL;
            ans.push_back("MULL");
        }
    }
    while (n != 1LL) {
        if (prev[n] == 0) {
            cout << 0 << endl;
            return 0;
        }
        if (prev[n] == n - 3) {
            n -= 3;
            ans.push_back("ADD");
        } else {
            n >>= 1LL;
            ans.push_back("MULL");
        }
    }
    reverse(all(ans));
    ans.push_back("END");
    cout << sz(ans) << endl;
    for (auto x: ans) {
        cout << x << endl;
    }
    return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
58

correct output
8
MUL
ADD
MUL
ADD
...

user output
8
MULL
ADD
MULL
ADD
...

Test 2

Group: 1

Verdict: ACCEPTED

input
72

correct output
0

user output
0

Test 3

Group: 1

Verdict:

input
83

correct output
8
MUL
ADD
MUL
MUL
...

user output
8
MULL
ADD
MULL
MULL
...

Test 4

Group: 1

Verdict:

input
53

correct output
8
ADD
MUL
ADD
MUL
...

user output
8
ADD
MULL
ADD
MULL
...

Test 5

Group: 1

Verdict:

input
100

correct output
8
ADD
MUL
ADD
MUL
...

user output
8
ADD
MULL
ADD
MULL
...

Test 6

Group: 1

Verdict:

input
64

correct output
6
ADD
MUL
MUL
MUL
...

user output
6
ADD
MULL
MULL
MULL
...

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:

input
77

correct output
9
ADD
ADD
MUL
ADD
...

user output
9
ADD
ADD
MULL
ADD
...

Test 11

Group: 2

Verdict: ACCEPTED

input
941694

correct output
0

user output
0

Test 12

Group: 2

Verdict:

input
905674

correct output
30
MUL
ADD
MUL
ADD
...

user output
30
MULL
ADD
MULL
ADD
...

Test 13

Group: 2

Verdict:

input
908426

correct output
29
ADD
MUL
ADD
MUL
...

user output
29
ADD
MULL
ADD
MULL
...

Test 14

Group: 2

Verdict:

input
960500

correct output
31
ADD
ADD
MUL
MUL
...

user output
31
ADD
ADD
MULL
MULL
...

Test 15

Group: 2

Verdict:

input
902101

correct output
27
MUL
ADD
MUL
ADD
...

user output
27
MULL
ADD
MULL
ADD
...

Test 16

Group: 2

Verdict:

input
994208

correct output
27
ADD
ADD
MUL
MUL
...

user output
27
ADD
ADD
MULL
MULL
...

Test 17

Group: 2

Verdict: ACCEPTED

input
923538

correct output
0

user output
0

Test 18

Group: 2

Verdict:

input
950287

correct output
24
MUL
ADD
MUL
ADD
...

user output
24
MULL
ADD
MULL
ADD
...

Test 19

Group: 2

Verdict:

input
950516

correct output
29
ADD
ADD
MUL
MUL
...

user output
29
ADD
ADD
MULL
MULL
...

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:

input
927875200723222396

correct output
94
MUL
ADD
MUL
MUL
...

user output
94
MULL
ADD
MULL
MULL
...

Test 25

Group: 3

Verdict:

input
990125206148420558

correct output
84
ADD
MUL
ADD
MUL
...

user output
84
ADD
MULL
ADD
MULL
...

Test 26

Group: 3

Verdict: ACCEPTED

input
964804802247123102

correct output
0

user output
0

Test 27

Group: 3

Verdict:

input
996610423667404231

correct output
96
MUL
ADD
MUL
ADD
...

user output
96
MULL
ADD
MULL
ADD
...

Test 28

Group: 3

Verdict:

input
948665008088793691

correct output
86
MUL
ADD
MUL
ADD
...

user output
86
MULL
ADD
MULL
ADD
...

Test 29

Group: 3

Verdict: ACCEPTED

input
969397787818953279

correct output
0

user output
0

Test 30

Group: 3

Verdict:

input
918471787211371085

correct output
90
ADD
MUL
ADD
MUL
...

user output
90
ADD
MULL
ADD
MULL
...