Submission #242461

# Submission time Handle Problem Language Result Execution time Memory
242461 2020-06-27T18:25:08 Z dolphingarlic Vim (BOI13_vim) C++14
100 / 100
39 ms 22776 KB
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
using namespace std;bool u[70000];int t[70000], p[70000][10], q[70000][10][10];int main() {ios_base::sync_with_stdio(0);cin.tie(0);int n, m = 0, e = 0;string s;cin >> n >> s;u[0] = true;t[m++] = s[0] - 'a';FOR(i, 1, n) {if (s[i] != 'e') {if (s[i - 1] == 'e') u[m] = true;t[m++] = s[i] - 'a';} else e++;}memset(q[0], 0x3f, sizeof q[0]);FOR(c, 0, 10) p[0][c] = (c == t[0] ? 0 : 2);FOR(i, 0, m) {FOR(c, 0, 10) {p[i + 1][c] = min(p[i][t[i]], q[i][t[i]][t[i]]) + 2;if (c != t[i]) {p[i + 1][c] = min(p[i + 1][c], q[i][t[i]][c]);if (!u[i]) p[i + 1][c] = min(p[i + 1][c], p[i][c]);}FOR(d, 0, 10) {q[i + 1][c][d] = min(p[i][t[i]], q[i][t[i]][t[i]]) + 5;if (c != t[i]) {q[i + 1][c][d] = min(q[i + 1][c][d], min(p[i][c], q[i][c][t[i]]) + 3);if (d != t[i]) q[i + 1][c][d] = min(q[i + 1][c][d], q[i][c][d] + 1);}if (d != t[i]) q[i + 1][c][d] = min(q[i + 1][c][d], q[i][t[i]][d] + 3);}}}cout << 2 * e + p[m][4] - 2;return 0;}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 512 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 6 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 6 ms 1536 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Correct 6 ms 1664 KB Output is correct
6 Correct 7 ms 1920 KB Output is correct
7 Correct 6 ms 1408 KB Output is correct
8 Correct 8 ms 1408 KB Output is correct
9 Correct 6 ms 1536 KB Output is correct
10 Correct 6 ms 1536 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 31 ms 19840 KB Output is correct
2 Correct 31 ms 19072 KB Output is correct
3 Correct 33 ms 20096 KB Output is correct
4 Correct 32 ms 20480 KB Output is correct
5 Correct 38 ms 22776 KB Output is correct
6 Correct 19 ms 10496 KB Output is correct
7 Correct 28 ms 17152 KB Output is correct
8 Correct 32 ms 19832 KB Output is correct
9 Correct 25 ms 14720 KB Output is correct
10 Correct 23 ms 14072 KB Output is correct
11 Correct 34 ms 20476 KB Output is correct
12 Correct 35 ms 22776 KB Output is correct
13 Correct 39 ms 22500 KB Output is correct
14 Correct 35 ms 22008 KB Output is correct
15 Correct 32 ms 18552 KB Output is correct
16 Correct 34 ms 20224 KB Output is correct
17 Correct 32 ms 19840 KB Output is correct
18 Correct 32 ms 20096 KB Output is correct
19 Correct 32 ms 19072 KB Output is correct
20 Correct 26 ms 16128 KB Output is correct