Task: | Ohjelma |
Sender: | fergusq |
Submission time: | 2017-01-19 15:51:19 +0200 |
Language: | C++ |
Status: | READY |
Result: | 58 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 21 |
#2 | ACCEPTED | 37 |
#3 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.04 s | 1 | details |
#2 | ACCEPTED | 0.04 s | 1 | details |
#3 | ACCEPTED | 0.06 s | 1 | details |
#4 | ACCEPTED | 0.04 s | 1 | details |
#5 | ACCEPTED | 0.04 s | 1 | details |
#6 | ACCEPTED | 0.04 s | 1 | details |
#7 | ACCEPTED | 0.05 s | 1 | details |
#8 | ACCEPTED | 0.06 s | 1 | details |
#9 | ACCEPTED | 0.04 s | 1 | details |
#10 | ACCEPTED | 0.05 s | 1 | details |
#11 | ACCEPTED | 0.05 s | 2 | details |
#12 | ACCEPTED | 0.12 s | 2 | details |
#13 | ACCEPTED | 0.11 s | 2 | details |
#14 | ACCEPTED | 0.15 s | 2 | details |
#15 | ACCEPTED | 0.12 s | 2 | details |
#16 | ACCEPTED | 0.10 s | 2 | details |
#17 | ACCEPTED | 0.06 s | 2 | details |
#18 | ACCEPTED | 0.17 s | 2 | details |
#19 | ACCEPTED | 0.11 s | 2 | details |
#20 | ACCEPTED | 0.05 s | 2 | details |
#21 | ACCEPTED | 0.05 s | 3 | details |
#22 | ACCEPTED | 0.04 s | 3 | details |
#23 | ACCEPTED | 0.04 s | 3 | details |
#24 | RUNTIME ERROR | 0.32 s | 3 | details |
#25 | RUNTIME ERROR | 0.24 s | 3 | details |
#26 | ACCEPTED | 0.04 s | 3 | details |
#27 | RUNTIME ERROR | 0.23 s | 3 | details |
#28 | RUNTIME ERROR | 0.26 s | 3 | details |
#29 | ACCEPTED | 0.04 s | 3 | details |
#30 | RUNTIME ERROR | 0.26 s | 3 | details |
Code
#include <iostream>#include <vector>using namespace std;typedef long long ll;const int MAX = 1000001;int a[MAX];string c[MAX];int p[MAX];int main() {ll n;cin >> n;if (n%3 == 0) {cout << "0\n";return 0;}a[1] = 1;int ans = 0;for (ll i = 1; i <= n; i++) {int s = a[i];if (s == 0) continue;if (i == n) {ans = s;break;}if (i+3 < MAX && (a[i+3] == 0 || a[i+3] > s+1)) {a[i+3] = s+1;c[i+3] = "ADD";p[i+3] = i;}if (i*2 < MAX && (a[i*2] == 0 || a[i*2] > s+1)) {a[i*2] = s+1;c[i*2] = "MUL";p[i*2] = i;}}cout << ans << "\n";vector<string> cmds;for (int i = n; i > 1;) {cmds.push_back(c[i]);i = p[i];}for (int i = cmds.size()-1; i >= 0; i--) {cout << cmds[i] << "\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: RUNTIME ERROR
input |
---|
927875200723222396 |
correct output |
---|
94 MUL ADD MUL MUL ... |
user output |
---|
(empty) |
Test 25
Group: 3
Verdict: RUNTIME ERROR
input |
---|
990125206148420558 |
correct output |
---|
84 ADD MUL ADD MUL ... |
user output |
---|
(empty) |
Test 26
Group: 3
Verdict: ACCEPTED
input |
---|
964804802247123102 |
correct output |
---|
0 |
user output |
---|
0 |
Test 27
Group: 3
Verdict: RUNTIME ERROR
input |
---|
996610423667404231 |
correct output |
---|
96 MUL ADD MUL ADD ... |
user output |
---|
(empty) |
Test 28
Group: 3
Verdict: RUNTIME ERROR
input |
---|
948665008088793691 |
correct output |
---|
86 MUL ADD MUL ADD ... |
user output |
---|
(empty) |
Test 29
Group: 3
Verdict: ACCEPTED
input |
---|
969397787818953279 |
correct output |
---|
0 |
user output |
---|
0 |
Test 30
Group: 3
Verdict: RUNTIME ERROR
input |
---|
918471787211371085 |
correct output |
---|
90 ADD MUL ADD MUL ... |
user output |
---|
(empty) |