oj.uz

Submission #243098

# Submission time Handle Problem Language Result Execution time Memory
243098 2020-06-30T10:28:17 Z ffao Vim (BOI13_vim) C++14
76 / 100
 2000 ms 134524 KB 
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int n;
string s;

#define JMPS 12

int ccE;
int nxtnE[71000];
int nxt[71000][21];
int idxE[71000];
int jmp[71000][11][JMPS+1];
int dist[71000][11][JMPS+1];
int spt[71000][10][17];

priority_queue< pair<int, pair<int, pii> > > q;

void update(int nextE, int let, int idx, int curDist) {
    if (dist[nextE][let][idx] > curDist) {
        dist[nextE][let][idx] = curDist;
        q.push( {-curDist, {nextE, {let, idx}}} );
    }
}

void expand(int curPos, int nextE, int curDist) {
    // cout << "EXP" << endl;
    
    int addD = 0;
    for (int j = 0; j < 9; j++) {
        for (int t = 16; t >= 0; t--) {
            if (spt[curPos][j][t] <= nextE) {
                addD += (1<<t) * 2;
                curPos = spt[curPos][j][t];
            }
        }

        for (int jj = 0; jj <= j; jj++) if (spt[curPos][jj][0] != n) {
            int letdst = s[ spt[curPos][jj][0] ] - 'a';
            update(nextE, letdst, 0, curDist + addD + 2);
        }
    }
    
    // cout << "EXPD" << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    cin >> n >> s;

    int st = 0;
    while (st < n && s[st] == 'e') st++;

    int rem = st;
    s = s.substr(st);
    n = (int)s.size();

    memset(dist, 0x3f, sizeof(dist));

    for (int j = 0; j < 10; j++) nxt[n][j] = n;
    for (int i = n-1; i >= 0; i--) {
        for (int j = 0; j < 10; j++) nxt[i][j] = nxt[i+1][j];
        nxt[i][s[i]-'a'] = i;
    }

    for (int i = 0; i < n; i++) if (s[i] == 'e') {
        nxtnE[i] = n;
        for (int j = 0; j < 10; j++) if (j != 4) {
            nxtnE[i] = min(nxtnE[i], nxt[i][j]);
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 10; j++) {
            jmp[i][j][0] = i;
            for (int k = 1; k <= JMPS; k++) {
                jmp[i][j][k] = jmp[i][j][k-1];
                if (jmp[i][j][k] < n) jmp[i][j][k] = nxt[jmp[i][j][k]+1][j];
            }
        }
    }

    for (int i = 0; i < n; i++) {
        vector<int> dests;
        for (int j = 0; j < 10; j++) if (j != 4) {
            dests.push_back(nxt[i+1][j]);
        }
        sort(all(dests));
        for (int j = 0; j < 9; j++) {
            spt[i][j][0] = dests[8-j];
        }
    }

    for (int j = 0; j < 9; j++) spt[n][j][0] = n;

    for (int k = 1; k < 17; k++) {
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j < 9; j++) {
                spt[i][j][k] = spt[ spt[i][j][k-1] ][j][k-1];
            }    
        }
    }

    int stE = nxt[0][4];
    if (stE == n) {
        cout << rem << endl;
        return 0;
    }

    int pE = stE;
    idxE[pE] = ccE++;
    while (pE < n) {
        pE = nxt[pE+1][4];
        idxE[pE] = ccE++;
    }

    expand(0, stE, 0);
    
    int ans = 1000000000;

    while (!q.empty()) {
        pair<int, pair<int, pii> > entry = q.top(); q.pop();
        int nextE = entry.second.first;
        int let = entry.second.second.first;
        int letidx = entry.second.second.second;
        int curDist = -entry.first;

        // cout << nextE << " " << let << " " << letidx << " " << curDist << endl;
        if (dist[nextE][let][letidx] != curDist) continue;

        int thisPos = jmp[nextE][let][letidx+1];

        // go back and fill up to nextE
        int nwNextE = nxt[thisPos+1][4];
        int cntEs = idxE[nwNextE] - idxE[nextE];

        if (nwNextE == n) {
            ans = min(ans, curDist + cntEs + (thisPos-nextE));
        }
        else {
            expand(nxtnE[nextE], nwNextE, curDist + cntEs + (thisPos-nextE));
        }

        // go forward
        for (int j = 0; j < 10; j++) if (j != 4) {
            int np = nxt[thisPos+1][j];
            if (np == n) continue;
            int nIdx = -1;
            for (int k = 1; k <= JMPS; k++) {
                if (jmp[nextE][j][k] == np) nIdx = k-1;
            }

            if (nIdx != -1) update(nextE, j, nIdx, curDist + 2);
        }
    }

    cout << ans + rem << endl;
    return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 40832 KB Output is correct
2 Correct 31 ms 40704 KB Output is correct
3 Correct 28 ms 40704 KB Output is correct
4 Correct 35 ms 40704 KB Output is correct
5 Correct 36 ms 40832 KB Output is correct
6 Correct 43 ms 40956 KB Output is correct
7 Correct 38 ms 40824 KB Output is correct
8 Correct 25 ms 40064 KB Output is correct
9 Correct 25 ms 40064 KB Output is correct
10 Correct 25 ms 40064 KB Output is correct
11 Correct 25 ms 40064 KB Output is correct
12 Correct 27 ms 40064 KB Output is correct
13 Correct 32 ms 40824 KB Output is correct
14 Correct 31 ms 40696 KB Output is correct
15 Correct 28 ms 40696 KB Output is correct
16 Correct 30 ms 40704 KB Output is correct
17 Correct 36 ms 40960 KB Output is correct
18 Correct 34 ms 40704 KB Output is correct
19 Correct 34 ms 40576 KB Output is correct
20 Correct 34 ms 40704 KB Output is correct
21 Correct 36 ms 40704 KB Output is correct
22 Correct 37 ms 40824 KB Output is correct
23 Correct 30 ms 40832 KB Output is correct
24 Correct 36 ms 40824 KB Output is correct
25 Correct 34 ms 40868 KB Output is correct
26 Correct 35 ms 40960 KB Output is correct
27 Correct 42 ms 41088 KB Output is correct
28 Correct 45 ms 40960 KB Output is correct
29 Correct 39 ms 40832 KB Output is correct
30 Correct 32 ms 40832 KB Output is correct
31 Correct 37 ms 40832 KB Output is correct
32 Correct 34 ms 40960 KB Output is correct
33 Correct 36 ms 40952 KB Output is correct
34 Correct 42 ms 41088 KB Output is correct
35 Correct 42 ms 40956 KB Output is correct
36 Correct 38 ms 40824 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 47096 KB Output is correct
2 Correct 269 ms 47120 KB Output is correct
3 Correct 111 ms 44152 KB Output is correct
4 Correct 181 ms 46968 KB Output is correct
5 Correct 244 ms 47096 KB Output is correct
6 Correct 166 ms 47096 KB Output is correct
7 Correct 174 ms 46972 KB Output is correct
8 Correct 189 ms 46976 KB Output is correct
9 Correct 276 ms 47096 KB Output is correct
10 Correct 211 ms 47096 KB Output is correct

Subtask #3
16.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1838 ms 120328 KB Output is correct
2 Correct 1594 ms 118392 KB Output is correct
3 Correct 1819 ms 120440 KB Output is correct
4 Incorrect 1907 ms 134524 KB Output isn't correct
5 Execution timed out 2098 ms 132336 KB Time limit exceeded
6 Execution timed out 2013 ms 121464 KB Time limit exceeded
7 Execution timed out 2096 ms 124536 KB Time limit exceeded
8 Execution timed out 2086 ms 126456 KB Time limit exceeded
9 Execution timed out 2092 ms 127336 KB Time limit exceeded
10 Execution timed out 2097 ms 126588 KB Time limit exceeded
11 Incorrect 1937 ms 134504 KB Output isn't correct
12 Execution timed out 2100 ms 132232 KB Time limit exceeded
13 Execution timed out 2025 ms 129544 KB Time limit exceeded
14 Correct 1850 ms 130472 KB Output is correct
15 Execution timed out 2098 ms 131572 KB Time limit exceeded
16 Correct 1268 ms 120812 KB Output is correct
17 Correct 1801 ms 120084 KB Output is correct
18 Correct 1807 ms 120364 KB Output is correct
19 Correct 1584 ms 118264 KB Output is correct
20 Execution timed out 2094 ms 119396 KB Time limit exceeded