# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
395925 | ArshiaDadras | Round words (IZhO13_rowords) | C++14 | 31 ms | 32716 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* In the name of Allah */
// Those were the days, my friend...
#include<bits/stdc++.h>
using namespace std;
string s, t;
const int N = 2e3 + 5;
int n, m, dp[N][2 * N], par[N][2 * N];
int calc(int i, int j, int st) {
int lcs = 0;
while (i && j > st)
if (!par[i][j]) {
i--, j--;
lcs++;
}
else
par[i][j] & 1? j--: i--;
return lcs;
}
void read_input() {
cin >> s >> t;
n = s.size();
m = t.size();
}
void solve() {
t += t;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= 2 * m; j++)
if (s[i - 1] == t[j - 1])
dp[i][j] = dp[i - 1][j - 1] + 1;
else {
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
par[i][j] = dp[i][j] > dp[i - 1][j]? 1: 2;
}
}
void write_output() {
int answer = 0;
for (int i = 0; i < m; i++)
answer = max(answer, calc(n, m + i, i));
cout << answer;
}
int main() {
ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
read_input(), solve(), write_output();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |