# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690514 | Kaztaev_Alisher | Round words (IZhO13_rowords) | C++17 | 14 ms | 16472 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>
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 2e3+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
ll dp[N][N];
void solve(){
string s , t;
cin >> s >> t;
sort(all(s));
sort(all(t));
s = "#" + s;
t = "#" + t;
for(int i = 1; i < s.size(); i++){
for(int j = 1; j < t.size(); j++){
dp[i][j] = max({dp[i][j-1] , dp[i-1][j] , dp[i-1][j-1]+(s[i]==t[j])});
}
}
cout << dp[s.size()-1][t.size()-1];
}
/*
*/
signed main(){
ios;
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |