oj.uz

Submission #101086

# Submission time Handle Problem Language Result Execution time Memory
101086 2019-03-16T12:24:16 Z choikiwon Round words (IZhO13_rowords) C++17
100 / 100
 391 ms 55160 KB 
#include<bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

const int MN = 2010;

int N, M;
string S, T;
int len[MN << 1][MN];
pii par[MN << 1][MN];
int root, ans;

int trace(int r, int c) {
    int ret = 0;
    while(r != root || c) {
        int nr = par[r][c].first;
        int nc = par[r][c].second;
        r = nr;
        c = nc;
        ret++;
    }
    return ret;
}

void reroot() {
    int i = root;
    int j = 1;
    while(j <= M && par[i][j] != pii(i - 1, j - 1)) j++;
    if(j > M) return;
    par[i][j] = pii(i, j - 1);
    while(i < 2 * N && j < M) {
        if(par[i + 1][j] == pii(i, j)) {
            i++;
            par[i][j] = pii(i, j - 1);
        }
        else if(par[i + 1][j + 1] == pii(i, j)) {
            i++;
            j++;
            par[i][j] = pii(i, j - 1);
        }
        else j++;
    }
    while(i < 2 * N && par[i + 1][j] == pii(i, j)) {
        i++;
        par[i][j] = pii(i, j - 1);
    }
}

void solve() {
    for(int i = 0; i <= 2 * N; i++) {
        for(int j = 0; j <= M; j++) {
            if(!i && !j) continue;

            len[i][j] = 1e9;
            if(j && len[i][j] > len[i][j - 1] + 1) len[i][j] = len[i][j - 1] + 1, par[i][j] = pii(i, j - 1);
            if(i && j && S[(i - 1) % N] == T[j - 1] && len[i][j] > len[i - 1][j - 1] + 1) len[i][j] = len[i - 1][j - 1] + 1, par[i][j] = pii(i - 1, j - 1);
            if(i && len[i][j] > len[i - 1][j] + 1) len[i][j] = len[i - 1][j] + 1, par[i][j] = pii(i - 1, j);
        }
    }

    root = 0;
    ans = max(ans, N + M - trace(N, M));
    for(int i = 1; i < N; i++) {
        root++;
        reroot();
        ans = max(ans, N + M - trace(N + i, M));
    }

    //cout << ans << endl;
}

int main() {
    std::ios::sync_with_stdio(false);

    cin >> S >> T;

    N = S.size();
    M = T.size();

    solve();
    reverse(T.begin(), T.end());
    solve();

    cout << ans;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1016 KB Output is correct
6 Correct 54 ms 18752 KB Output is correct
7 Correct 104 ms 39900 KB Output is correct
8 Correct 174 ms 39800 KB Output is correct
9 Correct 176 ms 39800 KB Output is correct
10 Correct 157 ms 39928 KB Output is correct
11 Correct 177 ms 43788 KB Output is correct
12 Correct 202 ms 48980 KB Output is correct
13 Correct 243 ms 49016 KB Output is correct
14 Correct 193 ms 45432 KB Output is correct
15 Correct 226 ms 51320 KB Output is correct
16 Correct 216 ms 43344 KB Output is correct
17 Correct 194 ms 43000 KB Output is correct
18 Correct 283 ms 55160 KB Output is correct
19 Correct 146 ms 39928 KB Output is correct
20 Correct 250 ms 49144 KB Output is correct
21 Correct 178 ms 33828 KB Output is correct
22 Correct 223 ms 39920 KB Output is correct
23 Correct 274 ms 44252 KB Output is correct
24 Correct 319 ms 46584 KB Output is correct
25 Correct 391 ms 53624 KB Output is correct