oj.uz

Submission #340372

# Submission time Handle Problem Language Result Execution time Memory
340372 2020-12-27T13:31:25 Z tengiz05 Round words (IZhO13_rowords) C++17
76 / 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+657){
			break;
		}
	}
	cout << ans << '\n';
	return;
}
 
signed main(){
	FASTIO;
	solve(1);
	return 0;
}

Subtask #1
76.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 85 ms 4716 KB Output is correct
7 Correct 1580 ms 8300 KB Output is correct
8 Execution timed out 2091 ms 8172 KB Time limit exceeded
9 Correct 1871 ms 8380 KB Output is correct
10 Correct 1598 ms 8300 KB Output is correct
11 Incorrect 1578 ms 9068 KB Output isn't correct
12 Correct 1628 ms 9832 KB Output is correct
13 Incorrect 1710 ms 9836 KB Output isn't correct
14 Correct 1589 ms 9452 KB Output is correct
15 Correct 1585 ms 10112 KB Output is correct
16 Execution timed out 2096 ms 8812 KB Time limit exceeded
17 Correct 1609 ms 9456 KB Output is correct
18 Incorrect 1589 ms 11628 KB Output isn't correct
19 Incorrect 1575 ms 8252 KB Output isn't correct
20 Correct 1867 ms 10348 KB Output is correct
21 Correct 324 ms 8300 KB Output is correct
22 Correct 952 ms 9452 KB Output is correct
23 Correct 1659 ms 10084 KB Output is correct
24 Correct 1667 ms 10604 KB Output is correct
25 Correct 1662 ms 12012 KB Output is correct