답안 #634535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
634535	2022-08-24T14:29:43 Z	LittleCube	Copy and Paste 3 (JOI22_copypaste3)	C++14	57 / 100	3000 ms	41040 KB

copypaste3

#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

const ll base = 29, mod = 1234567891;

int N;
char c[2505];
ll A, B, C, dp[2505][2505], h[2505][2505];

signed main()
{
	cin >> N;
	for(int i = 1; i <= N; i++)
		cin >> c[i];
	cin >> A >> B >> C;
	for(int i = 1; i <= N; i++)
		for(int j = i; j <= N; j++)
		{
			dp[i][j] = A * (j - i + 1);
			h[i][j] = (h[i][j - 1] * base + c[j] - 'a') % mod;
		}
	for(int i = N; i >= 1; i--)
		for(int k = i; k <= N; k++)
		{	
			for(int j = i + 1; j <= k; j++)
				dp[i][k] = min(dp[i][k], dp[j][k] + (j - i) * A);
			ll cur = dp[i][k] + B + C, pre = k;
			// cout << "copy: " << i << ' ' << k << " initial " << cur << '\n';
			for(int j = k + 1; j <= N; j++)
			{
				cur += A;
				if(pre < j - k + i && h[j - k + i][j] == h[i][k])
				{	
					cur += -(k - i + 1) * A + C;
					pre = j;
				}
				// cout << "copy: " << i << ' ' << k << " to " << i << ' ' << j << " cost " << cur << '\n';
				dp[i][j] = min(dp[i][j], cur);
			}
		}
	/* for(int i = 1; i <= N; i++)
		for(int j = 1; j <= N; j++)
			if(j < i) cout << "- ";
			else cout << dp[i][j] << " \n"[N == j];
	*/
	cout << dp[1][N] << '\n';
}

Subtask #1
1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct

Subtask #2
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Execution timed out	3074 ms	41040 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	0 ms	468 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	0 ms	468 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	1 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	0 ms	468 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	0 ms	340 KB	Output is correct
38	Correct	0 ms	340 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	0 ms	468 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	0 ms	468 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	1 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	0 ms	468 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	0 ms	340 KB	Output is correct
38	Correct	0 ms	340 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Correct	1 ms	980 KB	Output is correct
41	Correct	5 ms	2132 KB	Output is correct
42	Correct	5 ms	2132 KB	Output is correct
43	Correct	5 ms	2132 KB	Output is correct
44	Correct	5 ms	2132 KB	Output is correct
45	Correct	5 ms	2132 KB	Output is correct
46	Correct	5 ms	2132 KB	Output is correct
47	Correct	5 ms	2132 KB	Output is correct
48	Correct	5 ms	2212 KB	Output is correct
49	Correct	5 ms	2132 KB	Output is correct
50	Correct	5 ms	2132 KB	Output is correct
51	Correct	5 ms	2240 KB	Output is correct
52	Correct	5 ms	2132 KB	Output is correct
53	Correct	5 ms	2132 KB	Output is correct

Subtask #5
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	0 ms	468 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	0 ms	468 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	1 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	0 ms	468 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	0 ms	340 KB	Output is correct
38	Correct	0 ms	340 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Correct	1 ms	980 KB	Output is correct
41	Correct	5 ms	2132 KB	Output is correct
42	Correct	5 ms	2132 KB	Output is correct
43	Correct	5 ms	2132 KB	Output is correct
44	Correct	5 ms	2132 KB	Output is correct
45	Correct	5 ms	2132 KB	Output is correct
46	Correct	5 ms	2132 KB	Output is correct
47	Correct	5 ms	2132 KB	Output is correct
48	Correct	5 ms	2212 KB	Output is correct
49	Correct	5 ms	2132 KB	Output is correct
50	Correct	5 ms	2132 KB	Output is correct
51	Correct	5 ms	2240 KB	Output is correct
52	Correct	5 ms	2132 KB	Output is correct
53	Correct	5 ms	2132 KB	Output is correct
54	Correct	39 ms	5460 KB	Output is correct
55	Correct	421 ms	16168 KB	Output is correct
56	Correct	418 ms	16172 KB	Output is correct
57	Correct	437 ms	16164 KB	Output is correct
58	Correct	432 ms	16164 KB	Output is correct
59	Correct	445 ms	16084 KB	Output is correct
60	Correct	426 ms	16168 KB	Output is correct
61	Correct	455 ms	16204 KB	Output is correct
62	Correct	398 ms	16172 KB	Output is correct
63	Correct	425 ms	16168 KB	Output is correct
64	Correct	414 ms	16176 KB	Output is correct
65	Correct	423 ms	16168 KB	Output is correct
66	Correct	444 ms	16176 KB	Output is correct
67	Correct	459 ms	16172 KB	Output is correct

Subtask #6
0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Execution timed out	3074 ms	41040 KB	Time limit exceeded
14	Halted	0 ms	0 KB	-

답안 #634535

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 32.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
32.0 / 32.0

Subtask #6
0 / 38.0