oj.uz

Submission #340375

# Submission time Handle Problem Language Result Execution time Memory
340375 2020-12-27T13:32:52 Z tengiz05 Round words (IZhO13_rowords) C++17
64 / 100
 2000 ms 12012 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();
	vector<int> idx(m);
	for(i=0;i<m;i++)idx[i] = i;
	unsigned seed = chrono::system_clock::now().time_since_epoch().count();
	shuffle(all(idx), default_random_engine(seed));
	for(i=0;i<m;i++){
		short int now = idx[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
64.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 87 ms 4716 KB Output is correct
7 Correct 1576 ms 8300 KB Output is correct
8 Execution timed out 2098 ms 8172 KB Time limit exceeded
9 Incorrect 1875 ms 8252 KB Output isn't correct
10 Correct 1593 ms 8380 KB Output is correct
11 Incorrect 1557 ms 9068 KB Output isn't correct
12 Correct 1616 ms 9836 KB Output is correct
13 Incorrect 1714 ms 9836 KB Output isn't correct
14 Correct 1587 ms 9452 KB Output is correct
15 Incorrect 1574 ms 10112 KB Output isn't correct
16 Execution timed out 2045 ms 8812 KB Time limit exceeded
17 Incorrect 1589 ms 9452 KB Output isn't correct
18 Incorrect 1571 ms 11500 KB Output isn't correct
19 Correct 1541 ms 8252 KB Output is correct
20 Incorrect 1859 ms 10348 KB Output isn't correct
21 Correct 327 ms 8172 KB Output is correct
22 Correct 952 ms 9388 KB Output is correct
23 Correct 1637 ms 10092 KB Output is correct
24 Correct 1651 ms 10604 KB Output is correct
25 Correct 1650 ms 12012 KB Output is correct