# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
644950 | Baytoro | Round words (IZhO13_rowords) | C++17 | 15 ms | 16548 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;
#define Baytoro_MayrambekovOrz void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e18;
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
if(n==0)
return 1;
if(n%2==1)
return binpow(a, n-1)*a;
else{
int b=binpow(a, n/2);
return b*b;
}
}
int cost(pair<int,int> a, pair<int,int> b){
return (a.fr-b.fr)*(a.fr-b.fr)+(a.sc-b.sc)*(a.sc-b.sc);
}
int dp[2002][2002];
int h,g,c,n,m,q,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_MayrambekovOrz{
string a,b;
cin>>a>>b;
sort(all(a));
sort(all(b));
res=0;
for(i=0;i<a.size();i++){
for(j=0;j<b.size();j++){
if(a[i]==b[j])
dp[i+1][j+1]=dp[i][j]+1;
else
dp[i+1][j+1]=max(dp[i+1][j+1],max(dp[i][j+1],dp[i+1][j]));
res=max(res,dp[i+1][j+1]);
}
}
cout<<res<<endl;
}
main(){
//fopn("radio");
//ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |