oj.uz

답안 #933640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933640 2024-02-26T03:43:52 Z mgch 원형 문자열 (IZhO13_rowords) C++14
16 / 100
 2000 ms 20060 KB 
#include <bits/stdc++.h>

using namespace std;

/** so there is complicated algo based on some research let's get it later
 * 
 * 
 *  you have to get that |lcs(a, b) - lcs(a, b[1..n-1] + b[0])| <= 2
 *  so if you have ans >= lcs(a, b) + 2 then ... push it
 * */

const int N = 2024;

int dp[N][N], n, m;
string s[N], t[N];

int lcs(const string &a, const string &b) {
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);
            if (a[i] == b[j]) {
                dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + 1);
            }
        }
    }
    return dp[n][m];
}


int main() {
//  freopen("rowords.in", "r", stdin); freopen("rowords.out", "w", stdout);
    string a, b;
    getline(cin, a);
    getline(cin, b);
    n = a.length();
    m = b.length();
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        s[i] = a.substr(i) + a.substr(0, i);
    }
    for (int i = 0; i < m; ++i) {
        t[i] = b.substr(i) + b.substr(0, i);
    }
    for (int i = 0; i < n; ++i) {
        int curAns = 2;
        for (int j = 0; j < m; ++j) {
            if (ans <= curAns + 2) {
                curAns = lcs(s[i], t[j]);
                if (ans < curAns) {
                    ans = curAns;
                }
            }
            curAns += 2;
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
16.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 604 KB Output isn't correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 17 ms 768 KB Output is correct
5 Correct 5 ms 604 KB Output is correct
6 Execution timed out 2035 ms 6232 KB Time limit exceeded
7 Execution timed out 2005 ms 11096 KB Time limit exceeded
8 Execution timed out 2009 ms 11100 KB Time limit exceeded
9 Execution timed out 2061 ms 11100 KB Time limit exceeded
10 Execution timed out 2040 ms 11096 KB Time limit exceeded
11 Execution timed out 2066 ms 13400 KB Time limit exceeded
12 Execution timed out 2041 ms 13916 KB Time limit exceeded
13 Execution timed out 2043 ms 13916 KB Time limit exceeded
14 Execution timed out 2060 ms 13660 KB Time limit exceeded
15 Execution timed out 2072 ms 14172 KB Time limit exceeded
16 Execution timed out 2054 ms 13400 KB Time limit exceeded
17 Execution timed out 2054 ms 15708 KB Time limit exceeded
18 Execution timed out 2037 ms 16476 KB Time limit exceeded
19 Execution timed out 2029 ms 11100 KB Time limit exceeded
20 Execution timed out 2009 ms 15960 KB Time limit exceeded
21 Execution timed out 2039 ms 11868 KB Time limit exceeded
22 Execution timed out 2052 ms 14940 KB Time limit exceeded
23 Execution timed out 2058 ms 16476 KB Time limit exceeded
24 Execution timed out 2012 ms 17240 KB Time limit exceeded
25 Execution timed out 2043 ms 20060 KB Time limit exceeded