Submission #339772

#TimeUsernameProblemLanguageResultExecution timeMemory
339772tengiz05Round words (IZhO13_rowords)C++17
20 / 100
59 ms63232 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); #define all(x) (x).begin(), (x).end() #define pb push_back #define pii pair<int, int> #define ff first #define ss second #define PI acos(-1) #define ld long double template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;} template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;} const int mod = 1e9+7, N = 2005; int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;} int n, m, k; string a, b; int ans; int dp[2005][4005]; void do_it_now(){ memset(dp, 0, sizeof(dp)); 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-1] == b[j-1]){ chmax(dp[i][j], dp[i-1][j-1]+1); } } } chmax(ans, dp[n][m]); } void solve(int test_case){ int i, j; cin >> a >> b; if(a.length() > b.length())swap(a,b); // b += b; n = a.length(), m = b.length(); do_it_now(); reverse(all(b)); do_it_now(); cout << ans << '\n'; return; } signed main(){ FASTIO; #define MULTITEST 0 #if MULTITEST int _T; cin >> _T; for(int T_CASE = 1; T_CASE <= _T; T_CASE++) solve(T_CASE); #else solve(1); #endif return 0; }

Compilation message (stderr)

rowords.cpp: In function 'void solve(long long int)':
rowords.cpp:33:6: warning: unused variable 'i' [-Wunused-variable]
   33 |  int i, j;
      |      ^
rowords.cpp:33:9: warning: unused variable 'j' [-Wunused-variable]
   33 |  int i, j;
      |         ^
#Verdict Execution timeMemoryGrader output
Fetching results...