oj.uz

Submission #874875

# Submission time Handle Problem Language Result Execution time Memory
874875 2023-11-18T03:03:32 Z NK_ Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 3000 ms 409676 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back

#define f first
#define s second
#define mp make_pair

#define sz(x) int(x.size())

using pi = pair<int, int>;
using ll = long long;

template<class T> using V = vector<T>;

using vi = V<int>;
using vl = V<ll>;
using vpi = V<pi>;
using str = string;

const int MOD = 1e9 + 7;
const int base = 1009;
const ll INFL = ll(2e18);
const int LG = 18;

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int N; cin >> N;
	str S; cin >> S;

	ll a, b, c; cin >> a >> b >> c;

	V<vl> dp(N, vl(N, INFL));
	V<vi> nxt(N, vi(N, -1));

	for(int l = 0; l < N; l++) for(int r = l; r < N; r++) dp[l][r] = (r - l + 1) * a;

	V<map<int, int>> C(N);
	V<V<vi>> H(N);

	for(int l = 0; l < N; l++) {
		ll h = 0; 
		for(int w = 0; l + w < N; w++) {
			h = (base * h + S[l + w]) % MOD;

			// cout << l << " " << w << " " << h << endl;

			if (C[w].find(h) == C[w].end()) C[w][h] = sz(H[w]), H[w].pb({});

			H[w][C[w][h]].pb(l);
		}
	}

	for(int w = 0; w < N; w++) {
		// cout << w << endl;
		for(auto& v : H[w]) {
			// for(auto& x : v) cout << x << " ";
			// cout << endl;

			v.pb(MOD);
			for(auto& x : v) if (x != MOD) {
				nxt[x][x + w] = *lower_bound(begin(v), end(v), x + w + 1);
			}
		}
		// cout << endl;
	}

	for(int l = 0; l < N; l++) for(int r = l; r < N; r++) {
		if (nxt[l][r] >= MOD) nxt[l][r] = -1;
		// cout << l << " " << r << " " << nxt[l][r] << endl;
	}


	for(int w = 0; w < N; w++) {
		for(int l = 0; l + w < N; l++) {
			int r = l + w;
			
			if (r-1 >= 0) dp[l][r] = min(dp[l][r], dp[l][r-1] + a);
			if (l+1 < N) dp[l][r] = min(dp[l][r], dp[l+1][r] + a);

			// cout << l << " " << r << " " << dp[l][r] << endl;

			int L = l, amt = 1;
			while(nxt[L][L + w] != -1) {
				L = nxt[L][L + w], amt++;
				int left = (L + w - l + 1) - (l + w - l + 1) * amt;
				dp[l][L + w] = min(dp[l][L + w], dp[l][r] + b + c * amt + left * a);
				// cout << l << " " << l + w << " " << L << " " << L + w << " => " << dp[l][L + w] << endl;
			}
		}
	}

	cout << dp[0][N-1] << nl;

	exit(0-0);
}

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 229 ms 49244 KB Output is correct
4 Correct 291 ms 57424 KB Output is correct
5 Correct 365 ms 66900 KB Output is correct
6 Correct 541 ms 78600 KB Output is correct
7 Correct 561 ms 92104 KB Output is correct
8 Correct 575 ms 92312 KB Output is correct
9 Correct 573 ms 92240 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 388 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 860 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 6 ms 2908 KB Output is correct
43 Correct 6 ms 3000 KB Output is correct
44 Correct 6 ms 3164 KB Output is correct
45 Correct 6 ms 2988 KB Output is correct
46 Correct 6 ms 3160 KB Output is correct
47 Correct 3 ms 1476 KB Output is correct
48 Correct 6 ms 2140 KB Output is correct
49 Correct 5 ms 2396 KB Output is correct
50 Correct 5 ms 2528 KB Output is correct
51 Correct 4 ms 2136 KB Output is correct
52 Correct 4 ms 2140 KB Output is correct
53 Correct 6 ms 3040 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 388 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 860 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 6 ms 2908 KB Output is correct
43 Correct 6 ms 3000 KB Output is correct
44 Correct 6 ms 3164 KB Output is correct
45 Correct 6 ms 2988 KB Output is correct
46 Correct 6 ms 3160 KB Output is correct
47 Correct 3 ms 1476 KB Output is correct
48 Correct 6 ms 2140 KB Output is correct
49 Correct 5 ms 2396 KB Output is correct
50 Correct 5 ms 2528 KB Output is correct
51 Correct 4 ms 2136 KB Output is correct
52 Correct 4 ms 2140 KB Output is correct
53 Correct 6 ms 3040 KB Output is correct
54 Correct 33 ms 13712 KB Output is correct
55 Correct 45 ms 15140 KB Output is correct
56 Correct 273 ms 65916 KB Output is correct
57 Correct 265 ms 65988 KB Output is correct
58 Correct 263 ms 66268 KB Output is correct
59 Correct 267 ms 66444 KB Output is correct
60 Correct 267 ms 66340 KB Output is correct
61 Correct 156 ms 36180 KB Output is correct
62 Correct 46 ms 15708 KB Output is correct
63 Correct 228 ms 54148 KB Output is correct
64 Correct 211 ms 54268 KB Output is correct
65 Correct 173 ms 40856 KB Output is correct
66 Correct 162 ms 41040 KB Output is correct
67 Correct 288 ms 66388 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 229 ms 49244 KB Output is correct
14 Correct 291 ms 57424 KB Output is correct
15 Correct 365 ms 66900 KB Output is correct
16 Correct 541 ms 78600 KB Output is correct
17 Correct 561 ms 92104 KB Output is correct
18 Correct 575 ms 92312 KB Output is correct
19 Correct 573 ms 92240 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 388 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 1 ms 1116 KB Output is correct
59 Correct 6 ms 2908 KB Output is correct
60 Correct 6 ms 3000 KB Output is correct
61 Correct 6 ms 3164 KB Output is correct
62 Correct 6 ms 2988 KB Output is correct
63 Correct 6 ms 3160 KB Output is correct
64 Correct 3 ms 1476 KB Output is correct
65 Correct 6 ms 2140 KB Output is correct
66 Correct 5 ms 2396 KB Output is correct
67 Correct 5 ms 2528 KB Output is correct
68 Correct 4 ms 2136 KB Output is correct
69 Correct 4 ms 2140 KB Output is correct
70 Correct 6 ms 3040 KB Output is correct
71 Correct 33 ms 13712 KB Output is correct
72 Correct 45 ms 15140 KB Output is correct
73 Correct 273 ms 65916 KB Output is correct
74 Correct 265 ms 65988 KB Output is correct
75 Correct 263 ms 66268 KB Output is correct
76 Correct 267 ms 66444 KB Output is correct
77 Correct 267 ms 66340 KB Output is correct
78 Correct 156 ms 36180 KB Output is correct
79 Correct 46 ms 15708 KB Output is correct
80 Correct 228 ms 54148 KB Output is correct
81 Correct 211 ms 54268 KB Output is correct
82 Correct 173 ms 40856 KB Output is correct
83 Correct 162 ms 41040 KB Output is correct
84 Correct 288 ms 66388 KB Output is correct
85 Correct 974 ms 164436 KB Output is correct
86 Execution timed out 3081 ms 409676 KB Time limit exceeded
87 Halted 0 ms 0 KB -