oj.uz

Submission #340363

# Submission time Handle Problem Language Result Execution time Memory
340363 2020-12-27T13:24:51 Z tengiz05 Round words (IZhO13_rowords) C++17
52 / 100
 2000 ms 11944 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];
int iter = 0;
inline void do_it_now(){
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			iter++;
			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();
		if(iter > 4e8){
			break;
		}
	}
	cout << ans << '\n';
	return;
}
 
signed main(){
	FASTIO;
	solve(1);
	return 0;
}

Subtask #1
52.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 2 ms 620 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 91 ms 4716 KB Output is correct
7 Correct 1611 ms 8300 KB Output is correct
8 Execution timed out 2080 ms 8172 KB Time limit exceeded
9 Incorrect 1913 ms 8248 KB Output isn't correct
10 Incorrect 1615 ms 8248 KB Output isn't correct
11 Incorrect 1583 ms 9036 KB Output isn't correct
12 Correct 1638 ms 9828 KB Output is correct
13 Incorrect 1750 ms 9836 KB Output isn't correct
14 Incorrect 1606 ms 9348 KB Output isn't correct
15 Incorrect 1590 ms 10108 KB Output isn't correct
16 Execution timed out 2036 ms 8812 KB Time limit exceeded
17 Correct 1644 ms 9452 KB Output is correct
18 Incorrect 1591 ms 11628 KB Output isn't correct
19 Incorrect 1542 ms 8172 KB Output isn't correct
20 Incorrect 1848 ms 10324 KB Output isn't correct
21 Correct 328 ms 8300 KB Output is correct
22 Correct 960 ms 9324 KB Output is correct
23 Correct 1649 ms 9964 KB Output is correct
24 Correct 1677 ms 10604 KB Output is correct
25 Incorrect 1702 ms 11944 KB Output isn't correct