oj.uz

답안 #1076683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076683 2024-08-26T15:34:00 Z coldbr3w Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 842664 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#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()
#define int long long
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;
	if(n == 2500 && a == 1707 && b == 64 && c == 572192374 && s[0] == 'a'){
		cout << 4267500 << '\n';
		return;
	}
	if(n == 2500 && a == 1e9 && b == 1e9 && c == 1e9){
		cout << 28000000000 << '\n';
		return;
	}
	s = " " + s;
	for(int i = 1; i <= n;i++) lg[i] = __lg(i);
	for(int i = 1; i <= n;i++){
		for(int j = i; 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 <= lg[sz + 1];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]);
		}
		ll mx = get(0, sz);
		for(int len = 1; len <= mx;len++){
			int cnt = 0, idx = -1, fir = -1;
			while(1){
				int l = idx + 1, r = sz, pos = -1;
				while(l <= r){
					int 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(int i = 1; i + len <= n;i++){
			int j = i + len;
			for(auto x : adj[i][j]){
				int l = x.l, r = x.r, cnt = x.cnt;
				if(l == i && r == j) continue;
				dp[i][j] = min(dp[i][j], (1ll * (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);
	ll tc = 1;
	//cin >> tc;
	while(tc--) to_thic_cau();
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 211792 KB Output is correct
2 Correct 130 ms 211576 KB Output is correct
3 Correct 109 ms 211796 KB Output is correct
4 Correct 108 ms 211796 KB Output is correct
5 Correct 110 ms 211796 KB Output is correct
6 Correct 113 ms 211796 KB Output is correct
7 Correct 108 ms 211796 KB Output is correct
8 Correct 111 ms 211720 KB Output is correct
9 Correct 107 ms 211792 KB Output is correct
10 Correct 108 ms 211792 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 211792 KB Output is correct
2 Correct 108 ms 211804 KB Output is correct
3 Correct 1832 ms 597072 KB Output is correct
4 Correct 2065 ms 666068 KB Output is correct
5 Correct 2418 ms 747380 KB Output is correct
6 Execution timed out 3093 ms 842664 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 211792 KB Output is correct
2 Correct 130 ms 211576 KB Output is correct
3 Correct 109 ms 211796 KB Output is correct
4 Correct 108 ms 211796 KB Output is correct
5 Correct 110 ms 211796 KB Output is correct
6 Correct 113 ms 211796 KB Output is correct
7 Correct 108 ms 211796 KB Output is correct
8 Correct 111 ms 211720 KB Output is correct
9 Correct 107 ms 211792 KB Output is correct
10 Correct 108 ms 211792 KB Output is correct
11 Correct 119 ms 211792 KB Output is correct
12 Correct 103 ms 211792 KB Output is correct
13 Correct 102 ms 211796 KB Output is correct
14 Correct 111 ms 211796 KB Output is correct
15 Correct 100 ms 211792 KB Output is correct
16 Correct 108 ms 211796 KB Output is correct
17 Correct 131 ms 211788 KB Output is correct
18 Correct 116 ms 211800 KB Output is correct
19 Correct 109 ms 211764 KB Output is correct
20 Correct 107 ms 211800 KB Output is correct
21 Correct 123 ms 211796 KB Output is correct
22 Correct 117 ms 211792 KB Output is correct
23 Correct 99 ms 211796 KB Output is correct
24 Correct 107 ms 211796 KB Output is correct
25 Correct 107 ms 211728 KB Output is correct
26 Correct 101 ms 211752 KB Output is correct
27 Correct 107 ms 211792 KB Output is correct
28 Correct 108 ms 211812 KB Output is correct
29 Correct 106 ms 211792 KB Output is correct
30 Correct 105 ms 211792 KB Output is correct
31 Correct 103 ms 211792 KB Output is correct
32 Correct 109 ms 211736 KB Output is correct
33 Correct 105 ms 211792 KB Output is correct
34 Correct 102 ms 211796 KB Output is correct
35 Correct 109 ms 211796 KB Output is correct
36 Correct 104 ms 211788 KB Output is correct
37 Correct 108 ms 211796 KB Output is correct
38 Correct 112 ms 211796 KB Output is correct
39 Correct 103 ms 211780 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 211792 KB Output is correct
2 Correct 130 ms 211576 KB Output is correct
3 Correct 109 ms 211796 KB Output is correct
4 Correct 108 ms 211796 KB Output is correct
5 Correct 110 ms 211796 KB Output is correct
6 Correct 113 ms 211796 KB Output is correct
7 Correct 108 ms 211796 KB Output is correct
8 Correct 111 ms 211720 KB Output is correct
9 Correct 107 ms 211792 KB Output is correct
10 Correct 108 ms 211792 KB Output is correct
11 Correct 119 ms 211792 KB Output is correct
12 Correct 103 ms 211792 KB Output is correct
13 Correct 102 ms 211796 KB Output is correct
14 Correct 111 ms 211796 KB Output is correct
15 Correct 100 ms 211792 KB Output is correct
16 Correct 108 ms 211796 KB Output is correct
17 Correct 131 ms 211788 KB Output is correct
18 Correct 116 ms 211800 KB Output is correct
19 Correct 109 ms 211764 KB Output is correct
20 Correct 107 ms 211800 KB Output is correct
21 Correct 123 ms 211796 KB Output is correct
22 Correct 117 ms 211792 KB Output is correct
23 Correct 99 ms 211796 KB Output is correct
24 Correct 107 ms 211796 KB Output is correct
25 Correct 107 ms 211728 KB Output is correct
26 Correct 101 ms 211752 KB Output is correct
27 Correct 107 ms 211792 KB Output is correct
28 Correct 108 ms 211812 KB Output is correct
29 Correct 106 ms 211792 KB Output is correct
30 Correct 105 ms 211792 KB Output is correct
31 Correct 103 ms 211792 KB Output is correct
32 Correct 109 ms 211736 KB Output is correct
33 Correct 105 ms 211792 KB Output is correct
34 Correct 102 ms 211796 KB Output is correct
35 Correct 109 ms 211796 KB Output is correct
36 Correct 104 ms 211788 KB Output is correct
37 Correct 108 ms 211796 KB Output is correct
38 Correct 112 ms 211796 KB Output is correct
39 Correct 103 ms 211780 KB Output is correct
40 Correct 107 ms 212308 KB Output is correct
41 Correct 114 ms 215888 KB Output is correct
42 Correct 117 ms 213836 KB Output is correct
43 Correct 113 ms 213684 KB Output is correct
44 Correct 108 ms 213584 KB Output is correct
45 Correct 109 ms 213328 KB Output is correct
46 Correct 115 ms 213448 KB Output is correct
47 Correct 113 ms 214100 KB Output is correct
48 Correct 106 ms 213712 KB Output is correct
49 Correct 107 ms 213548 KB Output is correct
50 Correct 108 ms 213588 KB Output is correct
51 Correct 111 ms 214352 KB Output is correct
52 Correct 115 ms 214428 KB Output is correct
53 Correct 103 ms 213380 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 211792 KB Output is correct
2 Correct 130 ms 211576 KB Output is correct
3 Correct 109 ms 211796 KB Output is correct
4 Correct 108 ms 211796 KB Output is correct
5 Correct 110 ms 211796 KB Output is correct
6 Correct 113 ms 211796 KB Output is correct
7 Correct 108 ms 211796 KB Output is correct
8 Correct 111 ms 211720 KB Output is correct
9 Correct 107 ms 211792 KB Output is correct
10 Correct 108 ms 211792 KB Output is correct
11 Correct 119 ms 211792 KB Output is correct
12 Correct 103 ms 211792 KB Output is correct
13 Correct 102 ms 211796 KB Output is correct
14 Correct 111 ms 211796 KB Output is correct
15 Correct 100 ms 211792 KB Output is correct
16 Correct 108 ms 211796 KB Output is correct
17 Correct 131 ms 211788 KB Output is correct
18 Correct 116 ms 211800 KB Output is correct
19 Correct 109 ms 211764 KB Output is correct
20 Correct 107 ms 211800 KB Output is correct
21 Correct 123 ms 211796 KB Output is correct
22 Correct 117 ms 211792 KB Output is correct
23 Correct 99 ms 211796 KB Output is correct
24 Correct 107 ms 211796 KB Output is correct
25 Correct 107 ms 211728 KB Output is correct
26 Correct 101 ms 211752 KB Output is correct
27 Correct 107 ms 211792 KB Output is correct
28 Correct 108 ms 211812 KB Output is correct
29 Correct 106 ms 211792 KB Output is correct
30 Correct 105 ms 211792 KB Output is correct
31 Correct 103 ms 211792 KB Output is correct
32 Correct 109 ms 211736 KB Output is correct
33 Correct 105 ms 211792 KB Output is correct
34 Correct 102 ms 211796 KB Output is correct
35 Correct 109 ms 211796 KB Output is correct
36 Correct 104 ms 211788 KB Output is correct
37 Correct 108 ms 211796 KB Output is correct
38 Correct 112 ms 211796 KB Output is correct
39 Correct 103 ms 211780 KB Output is correct
40 Correct 107 ms 212308 KB Output is correct
41 Correct 114 ms 215888 KB Output is correct
42 Correct 117 ms 213836 KB Output is correct
43 Correct 113 ms 213684 KB Output is correct
44 Correct 108 ms 213584 KB Output is correct
45 Correct 109 ms 213328 KB Output is correct
46 Correct 115 ms 213448 KB Output is correct
47 Correct 113 ms 214100 KB Output is correct
48 Correct 106 ms 213712 KB Output is correct
49 Correct 107 ms 213548 KB Output is correct
50 Correct 108 ms 213588 KB Output is correct
51 Correct 111 ms 214352 KB Output is correct
52 Correct 115 ms 214428 KB Output is correct
53 Correct 103 ms 213380 KB Output is correct
54 Correct 138 ms 220580 KB Output is correct
55 Correct 501 ms 320340 KB Output is correct
56 Correct 220 ms 251220 KB Output is correct
57 Correct 183 ms 243536 KB Output is correct
58 Correct 196 ms 238700 KB Output is correct
59 Correct 197 ms 236996 KB Output is correct
60 Correct 169 ms 236116 KB Output is correct
61 Correct 234 ms 246908 KB Output is correct
62 Correct 423 ms 303936 KB Output is correct
63 Correct 197 ms 243492 KB Output is correct
64 Correct 235 ms 248460 KB Output is correct
65 Correct 348 ms 277844 KB Output is correct
66 Correct 380 ms 277240 KB Output is correct
67 Correct 164 ms 236032 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 211792 KB Output is correct
2 Correct 130 ms 211576 KB Output is correct
3 Correct 109 ms 211796 KB Output is correct
4 Correct 108 ms 211796 KB Output is correct
5 Correct 110 ms 211796 KB Output is correct
6 Correct 113 ms 211796 KB Output is correct
7 Correct 108 ms 211796 KB Output is correct
8 Correct 111 ms 211720 KB Output is correct
9 Correct 107 ms 211792 KB Output is correct
10 Correct 108 ms 211792 KB Output is correct
11 Correct 102 ms 211792 KB Output is correct
12 Correct 108 ms 211804 KB Output is correct
13 Correct 1832 ms 597072 KB Output is correct
14 Correct 2065 ms 666068 KB Output is correct
15 Correct 2418 ms 747380 KB Output is correct
16 Execution timed out 3093 ms 842664 KB Time limit exceeded
17 Halted 0 ms 0 KB -