oj.uz

Submission #491817

# Submission time Handle Problem Language Result Execution time Memory
491817 2021-12-04T15:25:39 Z Victor Vim (BOI13_vim) C++17
60 / 100
 461 ms 204880 KB 
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

int n, cnt = 0, memo[5001][5001], nxt[5001][130], prev_pos[130], prev_skip_e = 0, skip_e[5001],prefix[5001];
vi e;

string str;

int dp(int pos, int taken) {
    if (taken == cnt) return 0;

    int &ans = memo[pos][taken];
    if (ans != -1) return memo[pos][taken];

    ans = INF;
    if (e[taken] <= pos) {
        int nxt_taken = prefix[pos];
        int nxt_pos = skip_e[e[taken]];
        // cout << "pos = " << pos << " taken = " << taken << " nxt_taken = " << nxt_taken << " nxt_pos = " << nxt_pos << endl;
        ans = (pos - e[taken]) + dp(nxt_pos, nxt_taken);
    }

    rep(i, 'a', 'k') {
        if (i == 'e') continue;
        int npos = nxt[pos][i];
        if (npos != -1) ans = min(ans, 2 + dp(npos, taken));
    }

    // cout << "pos = " << pos << " taken = " << taken << " ans = " << ans << endl;
    return ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    memset(prev_pos, 0, sizeof(prev_pos));
    memset(prefix, 0, sizeof(prefix));
    memset(memo, -1, sizeof(memo));
    memset(nxt, -1, sizeof(nxt));

    cnt = 0;
    cin >> n >> str;
    rep(i, 0, n) {
        char let = str[i];
        rep(j, prev_pos[let], i) nxt[j][let] = i;

        prev_pos[let] = i;
        if (let != 'e') {
            rep(j,prev_skip_e,i)skip_e[j]=i;
            prev_skip_e = i;
        } else{
            ++cnt;
            e.pb(i);
            ++prefix[i];
        }
        prefix[i+1]=prefix[i];
    }

    cout << dp(0, 0) + cnt << endl;
    return 0;
}

Compilation message

vim.cpp: In function 'int main()':
vim.cpp:75:25: warning: array subscript has type 'char' [-Wchar-subscripts]
   75 |         rep(j, prev_pos[let], i) nxt[j][let] = i;
      |                         ^~~
vim.cpp:8:36: note: in definition of macro 'rep'
    8 | #define rep(i, a, b) for (int i = (a); i < (b); ++i)
      |                                    ^
vim.cpp:75:41: warning: array subscript has type 'char' [-Wchar-subscripts]
   75 |         rep(j, prev_pos[let], i) nxt[j][let] = i;
      |                                         ^~~
vim.cpp:77:18: warning: array subscript has type 'char' [-Wchar-subscripts]
   77 |         prev_pos[let] = i;
      |                  ^~~

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 100684 KB Output is correct
2 Correct 36 ms 100676 KB Output is correct
3 Correct 35 ms 100648 KB Output is correct
4 Correct 38 ms 100652 KB Output is correct
5 Correct 38 ms 100680 KB Output is correct
6 Correct 38 ms 100676 KB Output is correct
7 Correct 39 ms 100676 KB Output is correct
8 Correct 37 ms 100640 KB Output is correct
9 Correct 36 ms 100692 KB Output is correct
10 Correct 36 ms 100636 KB Output is correct
11 Correct 35 ms 100748 KB Output is correct
12 Correct 36 ms 100652 KB Output is correct
13 Correct 38 ms 100676 KB Output is correct
14 Correct 39 ms 100708 KB Output is correct
15 Correct 37 ms 100736 KB Output is correct
16 Correct 38 ms 100656 KB Output is correct
17 Correct 40 ms 100632 KB Output is correct
18 Correct 38 ms 100728 KB Output is correct
19 Correct 41 ms 100708 KB Output is correct
20 Correct 38 ms 100676 KB Output is correct
21 Correct 40 ms 100756 KB Output is correct
22 Correct 39 ms 100668 KB Output is correct
23 Correct 38 ms 100676 KB Output is correct
24 Correct 37 ms 100740 KB Output is correct
25 Correct 38 ms 100628 KB Output is correct
26 Correct 40 ms 100756 KB Output is correct
27 Correct 40 ms 100752 KB Output is correct
28 Correct 42 ms 100680 KB Output is correct
29 Correct 40 ms 100660 KB Output is correct
30 Correct 42 ms 100696 KB Output is correct
31 Correct 39 ms 100704 KB Output is correct
32 Correct 41 ms 100688 KB Output is correct
33 Correct 38 ms 100756 KB Output is correct
34 Correct 40 ms 100744 KB Output is correct
35 Correct 38 ms 100648 KB Output is correct
36 Correct 39 ms 100684 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 100892 KB Output is correct
2 Correct 459 ms 100936 KB Output is correct
3 Correct 119 ms 100788 KB Output is correct
4 Correct 232 ms 100892 KB Output is correct
5 Correct 454 ms 100896 KB Output is correct
6 Correct 412 ms 100908 KB Output is correct
7 Correct 280 ms 100888 KB Output is correct
8 Correct 298 ms 100812 KB Output is correct
9 Correct 461 ms 100740 KB Output is correct
10 Correct 444 ms 101060 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 118 ms 204576 KB Execution killed with signal 11
2 Runtime error 116 ms 204648 KB Execution killed with signal 11
3 Runtime error 128 ms 204592 KB Execution killed with signal 11
4 Runtime error 115 ms 204860 KB Execution killed with signal 11
5 Runtime error 154 ms 204804 KB Execution killed with signal 11
6 Runtime error 115 ms 204868 KB Execution killed with signal 11
7 Runtime error 116 ms 204748 KB Execution killed with signal 11
8 Runtime error 118 ms 204844 KB Execution killed with signal 11
9 Runtime error 124 ms 204828 KB Execution killed with signal 11
10 Runtime error 115 ms 204868 KB Execution killed with signal 11
11 Runtime error 119 ms 204864 KB Execution killed with signal 11
12 Runtime error 113 ms 204704 KB Execution killed with signal 11
13 Runtime error 114 ms 204740 KB Execution killed with signal 11
14 Runtime error 118 ms 204720 KB Execution killed with signal 11
15 Runtime error 116 ms 204880 KB Execution killed with signal 11
16 Runtime error 114 ms 204616 KB Execution killed with signal 11
17 Runtime error 113 ms 204484 KB Execution killed with signal 11
18 Runtime error 118 ms 204528 KB Execution killed with signal 11
19 Runtime error 117 ms 204660 KB Execution killed with signal 11
20 Runtime error 114 ms 204748 KB Execution killed with signal 11