답안 #776883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
776883	2023-07-08T11:12:53 Z	aZvezda	Copy and Paste 3 (JOI22_copypaste3)	C++14	25 / 100	3000 ms	60280 KB

copypaste3

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define cerr if(false)cerr

const ll MAX_N = 2510;
ll n, a, b, c;
string str;

ll dp[MAX_N][MAX_N][2];

ll solve(ll l, ll r, bool clip) {
	if(!clip) { return (r - l + 1) * a; }
	if(dp[l][r][clip] != -1) { return dp[l][r][clip]; }
	if(l == r) { return a; }
	ll &ans = dp[l][r][clip];
	ans = (r - l + 1) * a;
	ans = min(ans, solve(l + 1, r, true) + a);
	ans = min(ans, solve(l + 1, r, false) + a);
	cerr << "----------------------" << endl;
	for(ll len = 1; len <= (r - l + 1); len ++) {
		string now = str.substr(l, len);
		ll pos = l;
		ll total = solve(l, l + len - 1, true) + b;
		cerr << "Starting " << total << endl;
		while(pos <= r) {
			if(pos + len - 1 <= r && str.substr(pos, len) == now) {
				pos += len; 
				total += c;
				cerr << "p";
			} else {
				pos ++;		
				total += a;
				cerr << "w";
			}
		}
		total += max(0ll, r - pos + 1) * a;
		ans = min(ans, total);
		cerr << " For llerval " << l << " " << r 
			<< " " << len << " " << total << endl;
	}	
	cerr << l << " " << r << " " << str.substr(l, r - l + 1) << " "
		<< clip << " " << ans << endl;
	return ans;
}

signed main() {

	cin >> n >> str >> a >> b >> c;

	for(ll i = 0; i < n; i ++) {
		for(ll j = 0; j < n; j ++) {
			dp[i][j][0] = dp[i][j][1] = -1;
		}		
	}

	cout << solve(0, n - 1, true) << endl;
	
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
0 / 5.0

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

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	304 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	308 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	436 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	436 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	312 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	304 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	308 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	436 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	436 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	312 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	22 ms	760 KB	Output is correct
41	Correct	150 ms	1756 KB	Output is correct
42	Correct	791 ms	1760 KB	Output is correct
43	Correct	805 ms	1760 KB	Output is correct
44	Correct	850 ms	1768 KB	Output is correct
45	Correct	792 ms	1760 KB	Output is correct
46	Correct	810 ms	1668 KB	Output is correct
47	Correct	445 ms	1756 KB	Output is correct
48	Correct	651 ms	1764 KB	Output is correct
49	Correct	670 ms	1760 KB	Output is correct
50	Correct	653 ms	1868 KB	Output is correct
51	Correct	485 ms	1712 KB	Output is correct
52	Correct	497 ms	1772 KB	Output is correct
53	Correct	819 ms	1760 KB	Output is correct

Subtask #5
0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	304 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	308 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	436 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	436 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	312 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	22 ms	760 KB	Output is correct
41	Correct	150 ms	1756 KB	Output is correct
42	Correct	791 ms	1760 KB	Output is correct
43	Correct	805 ms	1760 KB	Output is correct
44	Correct	850 ms	1768 KB	Output is correct
45	Correct	792 ms	1760 KB	Output is correct
46	Correct	810 ms	1668 KB	Output is correct
47	Correct	445 ms	1756 KB	Output is correct
48	Correct	651 ms	1764 KB	Output is correct
49	Correct	670 ms	1760 KB	Output is correct
50	Correct	653 ms	1868 KB	Output is correct
51	Correct	485 ms	1712 KB	Output is correct
52	Correct	497 ms	1772 KB	Output is correct
53	Correct	819 ms	1760 KB	Output is correct
54	Execution timed out	3029 ms	5308 KB	Time limit exceeded
55	Halted	0 ms	0 KB	-

Subtask #6
0 / 38.0

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

답안 #776883

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