oj.uz

Submission #1076556

# Submission time Handle Problem Language Result Execution time Memory
1076556 2024-08-26T14:43:29 Z coldbr3w Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 765172 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<ll> z_function(string s) {
    ll n = s.length();
    vector<ll> z(n);
    ll l = 0, r = 0;
    for (int i = 0; i < n; ++i) {
        if (i <= r) z[i] = min(r - i * 1ll + 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{ll l,r,cnt;};
ll st[N][13], dp[N][N];
vector<ccjv>adj[N][N];
ll get(ll l, ll r){
	ll p = 31 - __builtin_clz(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(ll i = 1; i <= n;i++){
		for(ll j = 1; j <= n;j++) dp[i][j] = (j - i + 1) * a;
	}
	for(int i = 1; i <= n;i++){
		string t;
		for(int j = i; j <= n;j++) t += s[j];
		vector<ll>z = z_function(t);
		ll sz = (ll)t.size() - 1;
		for(int i = 0; i <= sz;i++) st[i][0] = z[i];
		for(int j = 1; j <= 12;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++){
			ll cnt = 0, idx = -1, fir = -1;
			while(1){
				ll 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 89 ms 211796 KB Output is correct
2 Correct 83 ms 211796 KB Output is correct
3 Correct 90 ms 211792 KB Output is correct
4 Correct 90 ms 211680 KB Output is correct
5 Correct 84 ms 211704 KB Output is correct
6 Correct 97 ms 212052 KB Output is correct
7 Correct 104 ms 211796 KB Output is correct
8 Correct 90 ms 211712 KB Output is correct
9 Correct 91 ms 211792 KB Output is correct
10 Correct 85 ms 211796 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 211936 KB Output is correct
2 Correct 88 ms 211552 KB Output is correct
3 Correct 2001 ms 610012 KB Output is correct
4 Correct 2587 ms 681156 KB Output is correct
5 Execution timed out 3051 ms 765172 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 211796 KB Output is correct
2 Correct 83 ms 211796 KB Output is correct
3 Correct 90 ms 211792 KB Output is correct
4 Correct 90 ms 211680 KB Output is correct
5 Correct 84 ms 211704 KB Output is correct
6 Correct 97 ms 212052 KB Output is correct
7 Correct 104 ms 211796 KB Output is correct
8 Correct 90 ms 211712 KB Output is correct
9 Correct 91 ms 211792 KB Output is correct
10 Correct 85 ms 211796 KB Output is correct
11 Correct 90 ms 211796 KB Output is correct
12 Correct 90 ms 211864 KB Output is correct
13 Correct 94 ms 211832 KB Output is correct
14 Correct 91 ms 211692 KB Output is correct
15 Correct 86 ms 211772 KB Output is correct
16 Correct 95 ms 211792 KB Output is correct
17 Correct 89 ms 211696 KB Output is correct
18 Correct 105 ms 211796 KB Output is correct
19 Correct 90 ms 211808 KB Output is correct
20 Correct 87 ms 211796 KB Output is correct
21 Correct 92 ms 211736 KB Output is correct
22 Correct 93 ms 211880 KB Output is correct
23 Correct 91 ms 211728 KB Output is correct
24 Correct 91 ms 211728 KB Output is correct
25 Correct 91 ms 211756 KB Output is correct
26 Correct 106 ms 211796 KB Output is correct
27 Correct 87 ms 211828 KB Output is correct
28 Correct 124 ms 211796 KB Output is correct
29 Correct 117 ms 211696 KB Output is correct
30 Correct 113 ms 211792 KB Output is correct
31 Correct 112 ms 211796 KB Output is correct
32 Correct 85 ms 211792 KB Output is correct
33 Correct 79 ms 211796 KB Output is correct
34 Correct 110 ms 211796 KB Output is correct
35 Correct 93 ms 211780 KB Output is correct
36 Correct 98 ms 211792 KB Output is correct
37 Correct 94 ms 211836 KB Output is correct
38 Correct 94 ms 211760 KB Output is correct
39 Correct 94 ms 211852 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 211796 KB Output is correct
2 Correct 83 ms 211796 KB Output is correct
3 Correct 90 ms 211792 KB Output is correct
4 Correct 90 ms 211680 KB Output is correct
5 Correct 84 ms 211704 KB Output is correct
6 Correct 97 ms 212052 KB Output is correct
7 Correct 104 ms 211796 KB Output is correct
8 Correct 90 ms 211712 KB Output is correct
9 Correct 91 ms 211792 KB Output is correct
10 Correct 85 ms 211796 KB Output is correct
11 Correct 90 ms 211796 KB Output is correct
12 Correct 90 ms 211864 KB Output is correct
13 Correct 94 ms 211832 KB Output is correct
14 Correct 91 ms 211692 KB Output is correct
15 Correct 86 ms 211772 KB Output is correct
16 Correct 95 ms 211792 KB Output is correct
17 Correct 89 ms 211696 KB Output is correct
18 Correct 105 ms 211796 KB Output is correct
19 Correct 90 ms 211808 KB Output is correct
20 Correct 87 ms 211796 KB Output is correct
21 Correct 92 ms 211736 KB Output is correct
22 Correct 93 ms 211880 KB Output is correct
23 Correct 91 ms 211728 KB Output is correct
24 Correct 91 ms 211728 KB Output is correct
25 Correct 91 ms 211756 KB Output is correct
26 Correct 106 ms 211796 KB Output is correct
27 Correct 87 ms 211828 KB Output is correct
28 Correct 124 ms 211796 KB Output is correct
29 Correct 117 ms 211696 KB Output is correct
30 Correct 113 ms 211792 KB Output is correct
31 Correct 112 ms 211796 KB Output is correct
32 Correct 85 ms 211792 KB Output is correct
33 Correct 79 ms 211796 KB Output is correct
34 Correct 110 ms 211796 KB Output is correct
35 Correct 93 ms 211780 KB Output is correct
36 Correct 98 ms 211792 KB Output is correct
37 Correct 94 ms 211836 KB Output is correct
38 Correct 94 ms 211760 KB Output is correct
39 Correct 94 ms 211852 KB Output is correct
40 Correct 90 ms 212352 KB Output is correct
41 Correct 106 ms 215872 KB Output is correct
42 Correct 106 ms 214100 KB Output is correct
43 Correct 108 ms 213844 KB Output is correct
44 Correct 104 ms 213692 KB Output is correct
45 Correct 99 ms 213588 KB Output is correct
46 Correct 102 ms 213764 KB Output is correct
47 Correct 107 ms 214164 KB Output is correct
48 Correct 114 ms 213768 KB Output is correct
49 Correct 100 ms 213752 KB Output is correct
50 Correct 102 ms 213800 KB Output is correct
51 Correct 106 ms 214644 KB Output is correct
52 Correct 95 ms 214580 KB Output is correct
53 Correct 109 ms 213488 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 211796 KB Output is correct
2 Correct 83 ms 211796 KB Output is correct
3 Correct 90 ms 211792 KB Output is correct
4 Correct 90 ms 211680 KB Output is correct
5 Correct 84 ms 211704 KB Output is correct
6 Correct 97 ms 212052 KB Output is correct
7 Correct 104 ms 211796 KB Output is correct
8 Correct 90 ms 211712 KB Output is correct
9 Correct 91 ms 211792 KB Output is correct
10 Correct 85 ms 211796 KB Output is correct
11 Correct 90 ms 211796 KB Output is correct
12 Correct 90 ms 211864 KB Output is correct
13 Correct 94 ms 211832 KB Output is correct
14 Correct 91 ms 211692 KB Output is correct
15 Correct 86 ms 211772 KB Output is correct
16 Correct 95 ms 211792 KB Output is correct
17 Correct 89 ms 211696 KB Output is correct
18 Correct 105 ms 211796 KB Output is correct
19 Correct 90 ms 211808 KB Output is correct
20 Correct 87 ms 211796 KB Output is correct
21 Correct 92 ms 211736 KB Output is correct
22 Correct 93 ms 211880 KB Output is correct
23 Correct 91 ms 211728 KB Output is correct
24 Correct 91 ms 211728 KB Output is correct
25 Correct 91 ms 211756 KB Output is correct
26 Correct 106 ms 211796 KB Output is correct
27 Correct 87 ms 211828 KB Output is correct
28 Correct 124 ms 211796 KB Output is correct
29 Correct 117 ms 211696 KB Output is correct
30 Correct 113 ms 211792 KB Output is correct
31 Correct 112 ms 211796 KB Output is correct
32 Correct 85 ms 211792 KB Output is correct
33 Correct 79 ms 211796 KB Output is correct
34 Correct 110 ms 211796 KB Output is correct
35 Correct 93 ms 211780 KB Output is correct
36 Correct 98 ms 211792 KB Output is correct
37 Correct 94 ms 211836 KB Output is correct
38 Correct 94 ms 211760 KB Output is correct
39 Correct 94 ms 211852 KB Output is correct
40 Correct 90 ms 212352 KB Output is correct
41 Correct 106 ms 215872 KB Output is correct
42 Correct 106 ms 214100 KB Output is correct
43 Correct 108 ms 213844 KB Output is correct
44 Correct 104 ms 213692 KB Output is correct
45 Correct 99 ms 213588 KB Output is correct
46 Correct 102 ms 213764 KB Output is correct
47 Correct 107 ms 214164 KB Output is correct
48 Correct 114 ms 213768 KB Output is correct
49 Correct 100 ms 213752 KB Output is correct
50 Correct 102 ms 213800 KB Output is correct
51 Correct 106 ms 214644 KB Output is correct
52 Correct 95 ms 214580 KB Output is correct
53 Correct 109 ms 213488 KB Output is correct
54 Correct 117 ms 221268 KB Output is correct
55 Correct 609 ms 324056 KB Output is correct
56 Correct 223 ms 255060 KB Output is correct
57 Correct 201 ms 247176 KB Output is correct
58 Correct 178 ms 242560 KB Output is correct
59 Correct 175 ms 240716 KB Output is correct
60 Correct 179 ms 240072 KB Output is correct
61 Correct 236 ms 250776 KB Output is correct
62 Correct 443 ms 307568 KB Output is correct
63 Correct 226 ms 247380 KB Output is correct
64 Correct 211 ms 252184 KB Output is correct
65 Correct 354 ms 281684 KB Output is correct
66 Correct 415 ms 281172 KB Output is correct
67 Correct 192 ms 240008 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 211796 KB Output is correct
2 Correct 83 ms 211796 KB Output is correct
3 Correct 90 ms 211792 KB Output is correct
4 Correct 90 ms 211680 KB Output is correct
5 Correct 84 ms 211704 KB Output is correct
6 Correct 97 ms 212052 KB Output is correct
7 Correct 104 ms 211796 KB Output is correct
8 Correct 90 ms 211712 KB Output is correct
9 Correct 91 ms 211792 KB Output is correct
10 Correct 85 ms 211796 KB Output is correct
11 Correct 91 ms 211936 KB Output is correct
12 Correct 88 ms 211552 KB Output is correct
13 Correct 2001 ms 610012 KB Output is correct
14 Correct 2587 ms 681156 KB Output is correct
15 Execution timed out 3051 ms 765172 KB Time limit exceeded
16 Halted 0 ms 0 KB -