oj.uz

Submission #340350

# Submission time Handle Problem Language Result Execution time Memory
340350 2020-12-27T13:17:59 Z tengiz05 Round words (IZhO13_rowords) C++17
40 / 100
 2000 ms 11884 KB 
#include <bits/stdc++.h>
using namespace std;
#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;}
short int n, m, k;
string a, b;
string B;
int ans;
int dp[2005][2005];
inline void do_it_now(){
	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){
	short int i, j;
	cin >> a >> B;
	if(a.length() < B.length())swap(a,B);
	n = a.length(), m = B.length();
	for(i=0;i<m;i++){
		short int now = i;
		b.erase(all(b));
		for(j=0;j<m;j++){
			if(now == m)now=0;
			b.pb(B[now]);
			now++;
		}
		do_it_now();
		reverse(all(b));
		do_it_now();
	}
	cout << ans << '\n';
	return;
}
 
signed main(){
	FASTIO;
	solve(1);
	return 0;
}

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 84 ms 4796 KB Output is correct
7 Execution timed out 2043 ms 8172 KB Time limit exceeded
8 Execution timed out 2079 ms 8172 KB Time limit exceeded
9 Execution timed out 2088 ms 8172 KB Time limit exceeded
10 Execution timed out 2044 ms 8300 KB Time limit exceeded
11 Execution timed out 2086 ms 8940 KB Time limit exceeded
12 Execution timed out 2045 ms 9708 KB Time limit exceeded
13 Execution timed out 2072 ms 9708 KB Time limit exceeded
14 Execution timed out 2098 ms 9324 KB Time limit exceeded
15 Execution timed out 2092 ms 10092 KB Time limit exceeded
16 Execution timed out 2077 ms 8812 KB Time limit exceeded
17 Execution timed out 2086 ms 9324 KB Time limit exceeded
18 Execution timed out 2099 ms 11500 KB Time limit exceeded
19 Execution timed out 2012 ms 8300 KB Time limit exceeded
20 Execution timed out 2094 ms 10220 KB Time limit exceeded
21 Correct 320 ms 8300 KB Output is correct
22 Correct 953 ms 9324 KB Output is correct
23 Correct 1789 ms 9984 KB Output is correct
24 Correct 1891 ms 10628 KB Output is correct
25 Execution timed out 2037 ms 11884 KB Time limit exceeded