oj.uz

Submission #544594

# Submission time Handle Problem Language Result Execution time Memory
544594 2022-04-02T13:16:35 Z pavement Copy and Paste 3 (JOI22_copypaste3) C++17
100 / 100
 954 ms 34260 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

const int p = 31, p2 = 53, MOD = 1e9 + 9, MOD2 = 1e9 + 7;
int N, A, B, C, dp[2505][2505], phsh[2505], phsh2[2505], powp[2505], powp2[2505], invpowp[2505], invpowp2[2505], nxt[2505];
char S[2505];
map<ii, vector<int> > vec;

int exp_mod(int a, int b, int m) {
	int r = 1;
	while (b) {
		if (b & 1ll) r = r * a % m;
		a = a * a % m;
		b >>= 1ll;
	}
	return r;
}

ii hsh(int l, int r) {
	int tmp = (phsh[r] - phsh[l - 1]) * invpowp[l - 1] % MOD;
	int tmp2 = (phsh2[r] - phsh2[l - 1]) * invpowp2[l - 1] % MOD2;
	return mp((tmp + MOD) % MOD, (tmp2 + MOD2) % MOD2);
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 0; i < N; i++) {
		if (i == 0) powp[i] = powp2[i] = 1;
		else powp[i] = powp[i - 1] * p % MOD, powp2[i] = powp2[i - 1] * p2 % MOD2;
		invpowp[i] = exp_mod(powp[i], MOD - 2, MOD);
		invpowp2[i] = exp_mod(powp2[i], MOD2 - 2, MOD2);
	}
	for (int i = 1; i <= N; i++) {
		cin >> S[i];
		phsh[i] = (phsh[i - 1] + (S[i] - 'a' + 1) * powp[i - 1]) % MOD;
		phsh2[i] = (phsh2[i - 1] + (S[i] - 'a' + 1) * powp2[i - 1]) % MOD2;
	}
	cin >> A >> B >> C;
	for (int i = 1; i <= N; i++)
		for (int j = i; j <= N; j++) dp[i][j] = (j - i + 1) * A;
	for (int i = 1; i <= N; i++) {
		vec.clear();
		for (int j = 1; j + i - 1 <= N; j++)
			vec[hsh(j, j + i - 1)].pb(j);
		for (auto j : vec) {
			reverse(j.second.begin(), j.second.end());
			for (int k = 0, ptr = 0; k < j.second.size(); k++) {
				while (ptr + 1 < j.second.size() && j.second[ptr + 1] - j.second[k] >= i) ptr++;
				if (j.second[ptr] - j.second[k] >= i) nxt[j.second[k]] = j.second[ptr];
				else nxt[j.second[k]] = -1;
			}
		}
		for (int j = 1; j + i - 1 <= N; j++) {
			if (i > 1) dp[j][j + i - 1] = min({dp[j][j + i - 1], dp[j + 1][j + i - 1] + A, dp[j][j + i - 2] + A});
			for (int curr = j, k = 1; curr != -1; k++, curr = nxt[curr])
				dp[j][curr + i - 1] = min(dp[j][curr + i - 1], (curr + i - j) * A - k * i * A + dp[j][j + i - 1] + k * C + B);
		}
	}
	cout << dp[1][N] << '\n';
}

Compilation message

copypaste3.cpp:50:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   50 | main() {
      | ^~~~
copypaste3.cpp: In function 'int main()':
copypaste3.cpp:74:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |    for (int k = 0, ptr = 0; k < j.second.size(); k++) {
      |                             ~~^~~~~~~~~~~~~~~~~
copypaste3.cpp:75:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     while (ptr + 1 < j.second.size() && j.second[ptr + 1] - j.second[k] >= i) ptr++;
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.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 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 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
5.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 Correct 175 ms 20912 KB Output is correct
4 Correct 259 ms 23720 KB Output is correct
5 Correct 249 ms 26892 KB Output is correct
6 Correct 297 ms 30292 KB Output is correct
7 Correct 325 ms 34000 KB Output is correct
8 Correct 358 ms 34000 KB Output is correct
9 Correct 359 ms 34000 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 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #3
14.0 / 14.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 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 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 436 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 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 340 KB Output is correct
20 Correct 3 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 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 1 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 1 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 468 KB Output is correct

Subtask #4
10.0 / 10.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 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 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 436 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 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 340 KB Output is correct
20 Correct 3 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 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 1 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 1 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 1364 KB Output is correct
42 Correct 8 ms 1364 KB Output is correct
43 Correct 8 ms 1236 KB Output is correct
44 Correct 5 ms 1236 KB Output is correct
45 Correct 14 ms 1236 KB Output is correct
46 Correct 5 ms 1236 KB Output is correct
47 Correct 4 ms 1236 KB Output is correct
48 Correct 4 ms 1236 KB Output is correct
49 Correct 6 ms 1236 KB Output is correct
50 Correct 5 ms 1344 KB Output is correct
51 Correct 4 ms 1236 KB Output is correct
52 Correct 4 ms 1236 KB Output is correct
53 Correct 8 ms 1352 KB Output is correct

Subtask #5
32.0 / 32.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 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 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 436 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 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 340 KB Output is correct
20 Correct 3 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 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 1 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 1 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 1364 KB Output is correct
42 Correct 8 ms 1364 KB Output is correct
43 Correct 8 ms 1236 KB Output is correct
44 Correct 5 ms 1236 KB Output is correct
45 Correct 14 ms 1236 KB Output is correct
46 Correct 5 ms 1236 KB Output is correct
47 Correct 4 ms 1236 KB Output is correct
48 Correct 4 ms 1236 KB Output is correct
49 Correct 6 ms 1236 KB Output is correct
50 Correct 5 ms 1344 KB Output is correct
51 Correct 4 ms 1236 KB Output is correct
52 Correct 4 ms 1236 KB Output is correct
53 Correct 8 ms 1352 KB Output is correct
54 Correct 32 ms 3012 KB Output is correct
55 Correct 57 ms 8368 KB Output is correct
56 Correct 157 ms 8468 KB Output is correct
57 Correct 131 ms 8404 KB Output is correct
58 Correct 175 ms 8404 KB Output is correct
59 Correct 130 ms 8460 KB Output is correct
60 Correct 121 ms 8452 KB Output is correct
61 Correct 104 ms 8396 KB Output is correct
62 Correct 41 ms 8276 KB Output is correct
63 Correct 110 ms 8424 KB Output is correct
64 Correct 110 ms 8416 KB Output is correct
65 Correct 99 ms 8408 KB Output is correct
66 Correct 109 ms 8512 KB Output is correct
67 Correct 142 ms 8448 KB Output is correct

Subtask #6
38.0 / 38.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 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 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 175 ms 20912 KB Output is correct
14 Correct 259 ms 23720 KB Output is correct
15 Correct 249 ms 26892 KB Output is correct
16 Correct 297 ms 30292 KB Output is correct
17 Correct 325 ms 34000 KB Output is correct
18 Correct 358 ms 34000 KB Output is correct
19 Correct 359 ms 34000 KB Output is correct
20 Correct 1 ms 340 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 340 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 468 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 436 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 3 ms 340 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 2 ms 1364 KB Output is correct
59 Correct 8 ms 1364 KB Output is correct
60 Correct 8 ms 1236 KB Output is correct
61 Correct 5 ms 1236 KB Output is correct
62 Correct 14 ms 1236 KB Output is correct
63 Correct 5 ms 1236 KB Output is correct
64 Correct 4 ms 1236 KB Output is correct
65 Correct 4 ms 1236 KB Output is correct
66 Correct 6 ms 1236 KB Output is correct
67 Correct 5 ms 1344 KB Output is correct
68 Correct 4 ms 1236 KB Output is correct
69 Correct 4 ms 1236 KB Output is correct
70 Correct 8 ms 1352 KB Output is correct
71 Correct 32 ms 3012 KB Output is correct
72 Correct 57 ms 8368 KB Output is correct
73 Correct 157 ms 8468 KB Output is correct
74 Correct 131 ms 8404 KB Output is correct
75 Correct 175 ms 8404 KB Output is correct
76 Correct 130 ms 8460 KB Output is correct
77 Correct 121 ms 8452 KB Output is correct
78 Correct 104 ms 8396 KB Output is correct
79 Correct 41 ms 8276 KB Output is correct
80 Correct 110 ms 8424 KB Output is correct
81 Correct 110 ms 8416 KB Output is correct
82 Correct 99 ms 8408 KB Output is correct
83 Correct 109 ms 8512 KB Output is correct
84 Correct 142 ms 8448 KB Output is correct
85 Correct 336 ms 16776 KB Output is correct
86 Correct 954 ms 34256 KB Output is correct
87 Correct 902 ms 34256 KB Output is correct
88 Correct 913 ms 34256 KB Output is correct
89 Correct 911 ms 34248 KB Output is correct
90 Correct 938 ms 34260 KB Output is correct
91 Correct 351 ms 34016 KB Output is correct
92 Correct 277 ms 34004 KB Output is correct
93 Correct 784 ms 34140 KB Output is correct
94 Correct 890 ms 34216 KB Output is correct
95 Correct 779 ms 34184 KB Output is correct
96 Correct 737 ms 34212 KB Output is correct
97 Correct 925 ms 34252 KB Output is correct