#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
using namespace std;
#define ll long long int
#define forr(n) for(ll i=0;i<n;i++)
#define um unordered_map<int,int>
#define vec vector<int>
#define vecl vector<ll>
#define pb push_back
#define bg begin()
#define en end()
void solve(){
string s,t;
cin>>s>>t;
int tt=s.size();
for(int i=0;i<tt;++i)
{
s.push_back(s[i]);
}
tt=t.size();
for(int i=0;i<tt;++i)
{
t.push_back(t[i]);
}
int dp[s.size()+1][t.size()+1] ;
memset(dp,0,sizeof(dp)) ;
for(int i=1;i<=s.size();i++){
for(int j=1;j<=t.size();j++){
if(s[i-1]==t[j-1])
dp[i][j]=1+dp[i-1][j-1] ;
else
dp[i][j] = max(dp[i-1][j],dp[i][j-1]) ;
}
}
string ans;
int i=s.size(),j=t.size();
while(i>0 && j>0){
if(s[i-1]==t[j-1])
{
ans+=s[i-1];
i--;j--;
}
else{
if(dp[i-1][j] > dp[i][j-1])
i--;
else
j--;
}
}
reverse(ans.bg,ans.en);
cout<<ans<<" ";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin>>t;
while(t--)
solve();
return 0;
}
Compilation message
rowords.cpp: In function 'void solve()':
rowords.cpp:44:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
44 | for(int i=1;i<=s.size();i++){
| ~^~~~~~~~~~
rowords.cpp:45:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | for(int j=1;j<=t.size();j++){
| ~^~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
1868 KB |
Output isn't correct |
7 |
Incorrect |
25 ms |
15976 KB |
Output isn't correct |
8 |
Incorrect |
15 ms |
15932 KB |
Output isn't correct |
9 |
Incorrect |
16 ms |
15984 KB |
Output isn't correct |
10 |
Incorrect |
18 ms |
15948 KB |
Output isn't correct |
11 |
Incorrect |
20 ms |
17484 KB |
Output isn't correct |
12 |
Incorrect |
14 ms |
20412 KB |
Output isn't correct |
13 |
Incorrect |
21 ms |
20428 KB |
Output isn't correct |
14 |
Incorrect |
21 ms |
18252 KB |
Output isn't correct |
15 |
Incorrect |
33 ms |
21764 KB |
Output isn't correct |
16 |
Incorrect |
16 ms |
17596 KB |
Output isn't correct |
17 |
Incorrect |
16 ms |
13260 KB |
Output isn't correct |
18 |
Incorrect |
25 ms |
20688 KB |
Output isn't correct |
19 |
Incorrect |
19 ms |
15976 KB |
Output isn't correct |
20 |
Incorrect |
18 ms |
18508 KB |
Output isn't correct |
21 |
Incorrect |
5 ms |
4300 KB |
Output isn't correct |
22 |
Incorrect |
11 ms |
7372 KB |
Output isn't correct |
23 |
Incorrect |
12 ms |
10188 KB |
Output isn't correct |
24 |
Incorrect |
12 ms |
10724 KB |
Output isn't correct |
25 |
Incorrect |
17 ms |
14412 KB |
Output isn't correct |