Submission #598896

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
598896	2022-07-19T07:21:42 Z	Arnch	Copy and Paste 3 (JOI22_copypaste3)	C++17	25 / 100	3000 ms	20572 KB

copypaste3

// oooo
/*
 har chi delet mikhad bebar ~
 gitar o ba khodet nabar! ~
 ;Amoo_Hasan;
*/

#include<bits/stdc++.h>
//#pragma GCC optimize("O3,no-stack-protector,unroll-loops")
//#pragma GCC target("avx2,fma")

using namespace std;

typedef long long ll;
typedef long double ld;

#define Sz(x) int((x).size())
#define All(x) (x).begin(), (x).end()
#define wtf(x) cout<<#x <<" : " <<x <<endl

constexpr ll inf = 1e18, N = 1e3 + 10, pr = 1000696969, mod = 1e9 + 9;

ll ha[N][N];
ll dp[N][N];

int main() {
    ios :: sync_with_stdio(0), cin.tie(0);

	int n; cin >>n;
	string s; cin >>s;
	ll A, B, C; cin >>A >>B >>C;

	for(int i = 0; i < n; i++) dp[i][i] = A;

	for(int i = 0; i < n; i++) ha[i][0] = (s[i] - 'a');
	for(int len = 1; len < n; len++)
		for(int i = 0; i < n - len; i++)
			ha[i][len] = (ha[i][len - 1] * pr + (s[i + len] - 'a')) % mod;

	for(int len = 1; len < n; len++) {
		for(int i = 0; i < n - len; i++) {
			int j = i + len;
			dp[i][j] = dp[i][j - 1] + A;
			for(int k = j; k > i; k--) {
				int nu = j - k;
				ll cnt = dp[k][j] + B, val = ha[k][nu], sum = cnt + C;
				for(int x = i; x < k;) {
					if(x + nu >= k || ha[x][nu] != val) {
						x++;
						sum += A;
					}
					else {
						x += nu + 1;
						sum += C;
					}
				}
				dp[i][j] = min(dp[i][j], sum);
			}
		}
	}

	cout<<dp[0][n - 1];


    return 0;
}

Subtask #1
1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	324 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 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	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Runtime error	24 ms	20572 KB	Execution killed with signal 11
4	Halted	0 ms	0 KB	-

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	324 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	468 KB	Output is correct
23	Correct	1 ms	456 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	1 ms	456 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	1 ms	468 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	468 KB	Output is correct
33	Correct	1 ms	460 KB	Output is correct
34	Correct	1 ms	324 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	328 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	328 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Correct	5 ms	980 KB	Output is correct
41	Correct	39 ms	2212 KB	Output is correct
42	Correct	95 ms	2172 KB	Output is correct
43	Correct	88 ms	2192 KB	Output is correct
44	Correct	88 ms	2216 KB	Output is correct
45	Correct	82 ms	2212 KB	Output is correct
46	Correct	77 ms	2188 KB	Output is correct
47	Correct	61 ms	2216 KB	Output is correct
48	Correct	71 ms	2212 KB	Output is correct
49	Correct	72 ms	2212 KB	Output is correct
50	Correct	80 ms	2316 KB	Output is correct
51	Correct	73 ms	2208 KB	Output is correct
52	Correct	67 ms	2176 KB	Output is correct
53	Correct	81 ms	2268 KB	Output is correct

Subtask #5
0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	324 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	468 KB	Output is correct
23	Correct	1 ms	456 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	1 ms	456 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	1 ms	468 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	468 KB	Output is correct
33	Correct	1 ms	460 KB	Output is correct
34	Correct	1 ms	324 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	328 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	328 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Correct	5 ms	980 KB	Output is correct
41	Correct	39 ms	2212 KB	Output is correct
42	Correct	95 ms	2172 KB	Output is correct
43	Correct	88 ms	2192 KB	Output is correct
44	Correct	88 ms	2216 KB	Output is correct
45	Correct	82 ms	2212 KB	Output is correct
46	Correct	77 ms	2188 KB	Output is correct
47	Correct	61 ms	2216 KB	Output is correct
48	Correct	71 ms	2212 KB	Output is correct
49	Correct	72 ms	2212 KB	Output is correct
50	Correct	80 ms	2316 KB	Output is correct
51	Correct	73 ms	2208 KB	Output is correct
52	Correct	67 ms	2176 KB	Output is correct
53	Correct	81 ms	2268 KB	Output is correct
54	Correct	1597 ms	5584 KB	Output is correct
55	Execution timed out	3059 ms	13800 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

Subtask #6
0 / 38.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	324 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Runtime error	24 ms	20572 KB	Execution killed with signal 11
14	Halted	0 ms	0 KB	-

Submission #598896

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 0 / 5.0

Subtask #3 14.0 / 14.0

Subtask #4 10.0 / 10.0

Subtask #5 0 / 32.0

Subtask #6 0 / 38.0

Subtask #1
1.0 / 1.0

Subtask #2
0 / 5.0

Subtask #3
14.0 / 14.0

Subtask #4
10.0 / 10.0

Subtask #5
0 / 32.0

Subtask #6
0 / 38.0