# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440478 | dutch | Round words (IZhO13_rowords) | C++17 | 39 ms | 11116 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.
#include <bits/stdc++.h>
using namespace std;
int n, m;
string a, b;
vector<vector<int>> get(){
a = '_' + a;
b = '-' + b;
vector<vector<int>> dp(n+1, vector<int> (m+1));
for(int i=1; i<=n; ++i){
for(int j=1; j<=m; ++j){
dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
if(a[i] == b[j]) dp[i][j] = max(dp[i][j], dp[i-1][j-1] + 1);
}
}
a.erase(a.begin());
b.erase(b.begin());
return dp;
}
int solve(){
vector<vector<int>> x, y;
x = get();
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
y = get();
reverse(b.begin(), b.end());
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |