oj.uz

Submission #587792

# Submission time Handle Problem Language Result Execution time Memory
587792 2022-07-02T11:22:54 Z Tekor Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 60840 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pll pair <ll,ll>
#define mp make_pair
#define f first
#define s second
#define all(v) v.begin(),v.end()
void boos() {
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}
const int N = 3e3 + 1;
const ll p = 433,p1 = 383;
const ll INF = (ll)1e9 + 7ll;
ll binpow(ll a,ll b) {
	ll ans = 1,k = a;
	while(b) { 
		if(b % 2)ans *= k;
		ans %= INF;
		k *= k;
		k %= INF;
		b /= 2ll;
	}
	return ans;
}
ll has[N],has1[N],st[N],st1[N];
ll dp[N][N];
ll cc[N][N];
pll ot[N][N];
pll calc(int l,int r) {
	ll tek = (has[r] - has[l - 1] + INF) % INF;
	tek = (tek * st[l]) % INF;
	ll tek1 = (has1[r] - has1[l - 1] + INF) % INF;
	tek1 = (tek1 * st1[l]) % INF;
	return mp(tek,tek1);
}
void solve() {
	int n;
	cin >> n;
	string s;
	cin >> s;
	ll a,b,c;
	cin >> a >> b >> c;
	s = "0" + s;
	ll tek = p,tek1 = p1;
	st[1] = binpow(tek,INF - 2);
	st1[1] = binpow(tek1,INF - 2);
	has[1] = (s[1] - 'a' + 1ll);
	has1[1] = has[1];
	for(int i = 2;i <= n;i++) {
		ll val = (s[i] - 'a' + 1ll);
		has[i] = (has[i - 1] + (tek * val) % INF) % INF;
		has1[i] = (has1[i - 1] + (tek1 * val) % INF) % INF;
		tek = (tek * p) % INF;
		tek1 = (tek1 * p1) % INF;
		st[i] = binpow(tek,INF - 2);
		st1[i] = binpow(tek1,INF - 2);
	}
	for(int l = 1;l <= n;l++) {
		for(int r = l;r <= n;r++)ot[l][r] = calc(l,r);
	}
	for(int i = 1;i <= n;i++)dp[i][i] = a;
//	for(int sz = 2;sz <= n;sz++) {
//		for(int l = 1;l <= n - sz + 1;l++) {
//			int r = l + sz - 1;
//			dp[l][r] = dp[l][r - 1] + a;
//			for(int sz1 = 1;sz1 * 2 <= sz;sz1++) {
//				for(int h = l;h <= r;h++)cc[h] = 1;
//				for(int h = r - 2 * sz1 + 1;h >= l;h--) {
//					cc[h] = max(cc[h],cc[h + 1]);
//					if(calc(h,h + sz1 - 1) == calc(r - sz1 + 1,r)) {
//						//cout << h << " " << h + sz1 - 1 << " === " << r - sz1 + 1 << " " << r << endl;
//						cc[h] = max(cc[h],cc[h + sz1] + 1);
//					}
//					dp[l][r] = min(dp[l][r],cc[h] * c + b + a * (ll)(sz - cc[h] * sz1) + dp[r - sz1 + 1][r]);
//				}
//			}
//		}
//	}
	for(int r = 2;r <= n;r++) {
		for(int l = r - 1;l >= 1;l--) {
			dp[l][r] = dp[l][r - 1] + a;
			dp[l][r] = min(dp[l][r],dp[l + 1][r] + a);
			int sz = r -l + 1;
			for(int sz1 = 1;sz1 * 2 <= sz;sz1++) {
				cc[l][sz1] = cc[l + 1][sz1];
				if(ot[l][l + sz1 - 1] == ot[r - sz1 + 1][r]) {
					if(cc[l + sz1][sz1] == 0)cc[l][sz1] = max(cc[l][sz1],2ll);
					else cc[l][sz1] = max(cc[l][sz1],cc[l + sz1][sz1] + 1);
				}
				dp[l][r] = min(dp[l][r],cc[l][sz1] * c + b + a * (ll)(sz - cc[l][sz1] * sz1) + dp[r - sz1 + 1][r]);
			}
		}
	}
	cout << dp[1][n];
}
int main() {
	boos();
	solve();
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Execution timed out 3095 ms 60840 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 0 ms 724 KB Output is correct
26 Correct 0 ms 724 KB Output is correct
27 Correct 1 ms 680 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 0 ms 596 KB Output is correct
32 Correct 0 ms 724 KB Output is correct
33 Correct 0 ms 724 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 468 KB Output is correct
39 Correct 1 ms 596 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 0 ms 724 KB Output is correct
26 Correct 0 ms 724 KB Output is correct
27 Correct 1 ms 680 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 0 ms 596 KB Output is correct
32 Correct 0 ms 724 KB Output is correct
33 Correct 0 ms 724 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 468 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 1364 KB Output is correct
41 Correct 4 ms 3284 KB Output is correct
42 Correct 4 ms 3284 KB Output is correct
43 Correct 6 ms 3284 KB Output is correct
44 Correct 4 ms 3284 KB Output is correct
45 Correct 4 ms 3284 KB Output is correct
46 Correct 4 ms 3284 KB Output is correct
47 Correct 4 ms 3284 KB Output is correct
48 Correct 4 ms 3284 KB Output is correct
49 Correct 4 ms 3284 KB Output is correct
50 Correct 4 ms 3284 KB Output is correct
51 Correct 4 ms 3284 KB Output is correct
52 Correct 7 ms 3284 KB Output is correct
53 Correct 4 ms 3284 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 0 ms 724 KB Output is correct
26 Correct 0 ms 724 KB Output is correct
27 Correct 1 ms 680 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 0 ms 596 KB Output is correct
32 Correct 0 ms 724 KB Output is correct
33 Correct 0 ms 724 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 468 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 1364 KB Output is correct
41 Correct 4 ms 3284 KB Output is correct
42 Correct 4 ms 3284 KB Output is correct
43 Correct 6 ms 3284 KB Output is correct
44 Correct 4 ms 3284 KB Output is correct
45 Correct 4 ms 3284 KB Output is correct
46 Correct 4 ms 3284 KB Output is correct
47 Correct 4 ms 3284 KB Output is correct
48 Correct 4 ms 3284 KB Output is correct
49 Correct 4 ms 3284 KB Output is correct
50 Correct 4 ms 3284 KB Output is correct
51 Correct 4 ms 3284 KB Output is correct
52 Correct 7 ms 3284 KB Output is correct
53 Correct 4 ms 3284 KB Output is correct
54 Correct 28 ms 8656 KB Output is correct
55 Correct 570 ms 26172 KB Output is correct
56 Correct 354 ms 26264 KB Output is correct
57 Correct 317 ms 26148 KB Output is correct
58 Correct 338 ms 26124 KB Output is correct
59 Correct 291 ms 26172 KB Output is correct
60 Correct 312 ms 26140 KB Output is correct
61 Correct 307 ms 26124 KB Output is correct
62 Correct 501 ms 26188 KB Output is correct
63 Correct 333 ms 26120 KB Output is correct
64 Correct 351 ms 26172 KB Output is correct
65 Correct 327 ms 26236 KB Output is correct
66 Correct 319 ms 26136 KB Output is correct
67 Correct 319 ms 26164 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Execution timed out 3095 ms 60840 KB Time limit exceeded
14 Halted 0 ms 0 KB -