# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933702 | sleepntsheep | Round words (IZhO13_rowords) | C++17 | 66 ms | 48392 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<stdio.h>
#define N 4002
void rev(char*s,int n){char t;for(int i=0;i*2<n;++i)t=s[i],s[i]=s[n-1-i],s[n-1-i]=t;}
int len(char*s){int z=0;while(s[z])++z;return z;}
void cpy(char*s,char*t,int n){while(n--)*s++=*t++;}
int hi(int a,int b){return a>b?a:b;}
char s[N],t[N];
int z,dp[N][N],n,m;
void shinlena()
{
cpy(s+1+n,s+1,n);cpy(t+1+m,t+1,m);
for(int i=1;i<=2*n;++i)for(int j=1;j<=2*m;++j)
dp[i][j]=hi(hi(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1]+(s[i]==t[j]));
for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)
{
if(dp[i][j]==1+dp[i-1][j-1])
z=hi(z,dp[i+n-1][j+m-1]-dp[i-1][j-1]);
else
{
z=hi(z,dp[i+n-1][j+m-1]-(dp[i][j]-(s[i]==t[j])));
}
}
}
int main()
{
scanf("%s%s",s+1,t+1);n=len(s+1),m=len(t+1);
shinlena();rev(s+1,n);shinlena();rev(t+1,m);shinlena();rev(s+1,n);shinlena();
printf("%d",z);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |