oj.uz

Submission #1076605

# Submission time Handle Problem Language Result Execution time Memory
1076605 2024-08-26T14:56:14 Z coldbr3w Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 579256 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<long long, long long>
#define pb push_back
#define F first
#define S second  
#define all(x) (x).begin(), (x).end()

const ll N = 3000;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll block = 350;
ll n,a,b,c;
string s;
vector<int> z_function(string s) {
    int n = s.length();
    vector<int> z(n);
    int l = 0, r = 0;
    for (int i = 0; i < n; ++i) {
        if (i <= r) z[i] = min(r - i + 1, z[i - l]);
        while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
        if (i + z[i] - 1 > r) {
            l = i;
            r = i + z[i] - 1;
        } 
    }
    return z;
}
struct ccjv{int l,r,cnt;};
int st[N][12];
ll dp[N][N], lg[N];
vector<ccjv>adj[N][N];
int get(int l, int r){
	int p = lg[r - l + 1];
	return max(st[l][p], st[r - (1 << p) + 1][p]);
}
void to_thic_cau(){ 
	cin >> n >> s >> a >> b >> c;
	s = " " + s;
	for(int i = 1; i <= n;i++) lg[i] = __lg(i);
	for(int i = 1; i <= n;i++){
		for(int j = 1; j <= n;j++) dp[i][j] = 1ll * (j - i + 1) * a;
	}
	for(int i = 1; i <= n;i++){
		string t;
		for(int j = i; j <= n;j++) t += s[j];
		vector<int>z = z_function(t);
		int sz = (ll)t.size() - 1;
		for(int i = 0; i <= sz;i++) st[i][0] = z[i];
		for(int j = 1; j <= 11;j++){
			for(int i = 0; i + (1 << j) <= sz + 1;i++) st[i][j] = max(st[i][j-1], st[i + (1 << (j - 1))][j - 1]);
		}
		for(int len = 1; len <= sz;len++){
			int cnt = 0, idx = -1, fir = -1;
			while(1){
				int l = idx + 1, r = sz, pos = -1;
				while(l <= r){
					ll mid = (l + r) / 2;
					if(get(idx + 1, mid) >= len) pos = mid, r = mid - 1;
					else l = mid + 1;
				}
				if(pos == -1) break;
				if(fir == -1) fir = pos;
				idx = pos + len - 1, cnt++;
				adj[fir + i][idx + i].pb({fir + i, fir + len - 1 + i, cnt});
			}
		}
	}
	for(int len = 0; len <= n;len++){
		for(ll i = 1; i + len <= n;i++){
			ll j = i + len;
			for(auto x : adj[i][j]){
				ll l = x.l, r = x.r, cnt = x.cnt;
				if(l == i && r == j) continue;
				dp[i][j] = min(dp[i][j], ((j - i + 1) - (r - l + 1) * cnt) * a + b + dp[l][r] + c * cnt);
			}
			if(i - 1 >= 0) dp[i-1][j] = min(dp[i-1][j], dp[i][j] + a);
			if(j + 1 <= n) dp[i][j+1] = min(dp[i][j+1], dp[i][j] + a);
		}
	}
	cout << dp[1][n] << "\n";
}     

signed main()   
{  
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	ll tc = 1;
	//cin >> tc;
	while(tc--) to_thic_cau();
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 211636 KB Output is correct
2 Correct 86 ms 211792 KB Output is correct
3 Correct 85 ms 211688 KB Output is correct
4 Correct 85 ms 211796 KB Output is correct
5 Correct 84 ms 211692 KB Output is correct
6 Correct 85 ms 211788 KB Output is correct
7 Correct 82 ms 211792 KB Output is correct
8 Correct 86 ms 211792 KB Output is correct
9 Correct 84 ms 211796 KB Output is correct
10 Correct 83 ms 211796 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 211792 KB Output is correct
2 Correct 84 ms 211804 KB Output is correct
3 Correct 1799 ms 437328 KB Output is correct
4 Correct 2320 ms 477216 KB Output is correct
5 Correct 2787 ms 524372 KB Output is correct
6 Execution timed out 3088 ms 579256 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 211636 KB Output is correct
2 Correct 86 ms 211792 KB Output is correct
3 Correct 85 ms 211688 KB Output is correct
4 Correct 85 ms 211796 KB Output is correct
5 Correct 84 ms 211692 KB Output is correct
6 Correct 85 ms 211788 KB Output is correct
7 Correct 82 ms 211792 KB Output is correct
8 Correct 86 ms 211792 KB Output is correct
9 Correct 84 ms 211796 KB Output is correct
10 Correct 83 ms 211796 KB Output is correct
11 Correct 90 ms 211792 KB Output is correct
12 Correct 84 ms 211796 KB Output is correct
13 Correct 78 ms 211792 KB Output is correct
14 Correct 86 ms 211792 KB Output is correct
15 Correct 90 ms 211840 KB Output is correct
16 Correct 83 ms 211796 KB Output is correct
17 Correct 85 ms 211796 KB Output is correct
18 Correct 86 ms 211652 KB Output is correct
19 Correct 89 ms 211796 KB Output is correct
20 Correct 77 ms 211792 KB Output is correct
21 Correct 82 ms 211720 KB Output is correct
22 Correct 79 ms 211744 KB Output is correct
23 Correct 84 ms 211952 KB Output is correct
24 Correct 92 ms 211796 KB Output is correct
25 Correct 86 ms 211792 KB Output is correct
26 Correct 78 ms 211796 KB Output is correct
27 Correct 84 ms 211840 KB Output is correct
28 Correct 88 ms 211848 KB Output is correct
29 Correct 83 ms 211796 KB Output is correct
30 Correct 78 ms 211792 KB Output is correct
31 Correct 85 ms 211796 KB Output is correct
32 Correct 80 ms 211796 KB Output is correct
33 Correct 84 ms 211760 KB Output is correct
34 Correct 83 ms 211804 KB Output is correct
35 Correct 83 ms 211796 KB Output is correct
36 Correct 89 ms 211796 KB Output is correct
37 Correct 89 ms 211792 KB Output is correct
38 Correct 86 ms 211792 KB Output is correct
39 Correct 89 ms 211796 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 211636 KB Output is correct
2 Correct 86 ms 211792 KB Output is correct
3 Correct 85 ms 211688 KB Output is correct
4 Correct 85 ms 211796 KB Output is correct
5 Correct 84 ms 211692 KB Output is correct
6 Correct 85 ms 211788 KB Output is correct
7 Correct 82 ms 211792 KB Output is correct
8 Correct 86 ms 211792 KB Output is correct
9 Correct 84 ms 211796 KB Output is correct
10 Correct 83 ms 211796 KB Output is correct
11 Correct 90 ms 211792 KB Output is correct
12 Correct 84 ms 211796 KB Output is correct
13 Correct 78 ms 211792 KB Output is correct
14 Correct 86 ms 211792 KB Output is correct
15 Correct 90 ms 211840 KB Output is correct
16 Correct 83 ms 211796 KB Output is correct
17 Correct 85 ms 211796 KB Output is correct
18 Correct 86 ms 211652 KB Output is correct
19 Correct 89 ms 211796 KB Output is correct
20 Correct 77 ms 211792 KB Output is correct
21 Correct 82 ms 211720 KB Output is correct
22 Correct 79 ms 211744 KB Output is correct
23 Correct 84 ms 211952 KB Output is correct
24 Correct 92 ms 211796 KB Output is correct
25 Correct 86 ms 211792 KB Output is correct
26 Correct 78 ms 211796 KB Output is correct
27 Correct 84 ms 211840 KB Output is correct
28 Correct 88 ms 211848 KB Output is correct
29 Correct 83 ms 211796 KB Output is correct
30 Correct 78 ms 211792 KB Output is correct
31 Correct 85 ms 211796 KB Output is correct
32 Correct 80 ms 211796 KB Output is correct
33 Correct 84 ms 211760 KB Output is correct
34 Correct 83 ms 211804 KB Output is correct
35 Correct 83 ms 211796 KB Output is correct
36 Correct 89 ms 211796 KB Output is correct
37 Correct 89 ms 211792 KB Output is correct
38 Correct 86 ms 211792 KB Output is correct
39 Correct 89 ms 211796 KB Output is correct
40 Correct 92 ms 212304 KB Output is correct
41 Correct 92 ms 214360 KB Output is correct
42 Correct 98 ms 213588 KB Output is correct
43 Correct 89 ms 213532 KB Output is correct
44 Correct 89 ms 213516 KB Output is correct
45 Correct 86 ms 213576 KB Output is correct
46 Correct 94 ms 213364 KB Output is correct
47 Correct 88 ms 213588 KB Output is correct
48 Correct 92 ms 213348 KB Output is correct
49 Correct 87 ms 213588 KB Output is correct
50 Correct 88 ms 213420 KB Output is correct
51 Correct 90 ms 213844 KB Output is correct
52 Correct 94 ms 213844 KB Output is correct
53 Correct 91 ms 213584 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 211636 KB Output is correct
2 Correct 86 ms 211792 KB Output is correct
3 Correct 85 ms 211688 KB Output is correct
4 Correct 85 ms 211796 KB Output is correct
5 Correct 84 ms 211692 KB Output is correct
6 Correct 85 ms 211788 KB Output is correct
7 Correct 82 ms 211792 KB Output is correct
8 Correct 86 ms 211792 KB Output is correct
9 Correct 84 ms 211796 KB Output is correct
10 Correct 83 ms 211796 KB Output is correct
11 Correct 90 ms 211792 KB Output is correct
12 Correct 84 ms 211796 KB Output is correct
13 Correct 78 ms 211792 KB Output is correct
14 Correct 86 ms 211792 KB Output is correct
15 Correct 90 ms 211840 KB Output is correct
16 Correct 83 ms 211796 KB Output is correct
17 Correct 85 ms 211796 KB Output is correct
18 Correct 86 ms 211652 KB Output is correct
19 Correct 89 ms 211796 KB Output is correct
20 Correct 77 ms 211792 KB Output is correct
21 Correct 82 ms 211720 KB Output is correct
22 Correct 79 ms 211744 KB Output is correct
23 Correct 84 ms 211952 KB Output is correct
24 Correct 92 ms 211796 KB Output is correct
25 Correct 86 ms 211792 KB Output is correct
26 Correct 78 ms 211796 KB Output is correct
27 Correct 84 ms 211840 KB Output is correct
28 Correct 88 ms 211848 KB Output is correct
29 Correct 83 ms 211796 KB Output is correct
30 Correct 78 ms 211792 KB Output is correct
31 Correct 85 ms 211796 KB Output is correct
32 Correct 80 ms 211796 KB Output is correct
33 Correct 84 ms 211760 KB Output is correct
34 Correct 83 ms 211804 KB Output is correct
35 Correct 83 ms 211796 KB Output is correct
36 Correct 89 ms 211796 KB Output is correct
37 Correct 89 ms 211792 KB Output is correct
38 Correct 86 ms 211792 KB Output is correct
39 Correct 89 ms 211796 KB Output is correct
40 Correct 92 ms 212304 KB Output is correct
41 Correct 92 ms 214360 KB Output is correct
42 Correct 98 ms 213588 KB Output is correct
43 Correct 89 ms 213532 KB Output is correct
44 Correct 89 ms 213516 KB Output is correct
45 Correct 86 ms 213576 KB Output is correct
46 Correct 94 ms 213364 KB Output is correct
47 Correct 88 ms 213588 KB Output is correct
48 Correct 92 ms 213348 KB Output is correct
49 Correct 87 ms 213588 KB Output is correct
50 Correct 88 ms 213420 KB Output is correct
51 Correct 90 ms 213844 KB Output is correct
52 Correct 94 ms 213844 KB Output is correct
53 Correct 91 ms 213584 KB Output is correct
54 Correct 100 ms 218704 KB Output is correct
55 Correct 453 ms 276684 KB Output is correct
56 Correct 181 ms 242120 KB Output is correct
57 Correct 160 ms 240208 KB Output is correct
58 Correct 154 ms 239440 KB Output is correct
59 Correct 141 ms 239184 KB Output is correct
60 Correct 143 ms 239216 KB Output is correct
61 Correct 174 ms 240724 KB Output is correct
62 Correct 357 ms 268876 KB Output is correct
63 Correct 164 ms 240212 KB Output is correct
64 Correct 190 ms 241676 KB Output is correct
65 Correct 288 ms 255976 KB Output is correct
66 Correct 275 ms 255828 KB Output is correct
67 Correct 143 ms 239188 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 211636 KB Output is correct
2 Correct 86 ms 211792 KB Output is correct
3 Correct 85 ms 211688 KB Output is correct
4 Correct 85 ms 211796 KB Output is correct
5 Correct 84 ms 211692 KB Output is correct
6 Correct 85 ms 211788 KB Output is correct
7 Correct 82 ms 211792 KB Output is correct
8 Correct 86 ms 211792 KB Output is correct
9 Correct 84 ms 211796 KB Output is correct
10 Correct 83 ms 211796 KB Output is correct
11 Correct 92 ms 211792 KB Output is correct
12 Correct 84 ms 211804 KB Output is correct
13 Correct 1799 ms 437328 KB Output is correct
14 Correct 2320 ms 477216 KB Output is correct
15 Correct 2787 ms 524372 KB Output is correct
16 Execution timed out 3088 ms 579256 KB Time limit exceeded
17 Halted 0 ms 0 KB -