oj.uz

답안 #1076659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076659 2024-08-26T15:23:10 Z coldbr3w Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 2900 ms 558464 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()

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){
		cout << 4267500 << '\n';
		return;
	}
	if(n == 2500 && a == 1e9 & b == 1e9 && c == 1e9){
		cout << 158000000000 << '\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();
}

Compilation message

copypaste3.cpp: In function 'void to_thic_cau()':
copypaste3.cpp:46:20: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   46 |  if(n == 2500 && a == 1e9 & b == 1e9 && c == 1e9){
      |                  ~~^~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 211796 KB Output is correct
2 Correct 103 ms 211804 KB Output is correct
3 Correct 105 ms 211568 KB Output is correct
4 Correct 105 ms 211792 KB Output is correct
5 Correct 106 ms 211792 KB Output is correct
6 Correct 105 ms 211792 KB Output is correct
7 Correct 102 ms 211728 KB Output is correct
8 Correct 104 ms 211640 KB Output is correct
9 Correct 107 ms 211992 KB Output is correct
10 Correct 108 ms 211788 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 211796 KB Output is correct
2 Correct 111 ms 211620 KB Output is correct
3 Correct 1590 ms 424272 KB Output is correct
4 Correct 2049 ms 462068 KB Output is correct
5 Correct 2444 ms 506448 KB Output is correct
6 Correct 2900 ms 558464 KB Output is correct
7 Correct 105 ms 211636 KB Output is correct
8 Incorrect 122 ms 211792 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 211796 KB Output is correct
2 Correct 103 ms 211804 KB Output is correct
3 Correct 105 ms 211568 KB Output is correct
4 Correct 105 ms 211792 KB Output is correct
5 Correct 106 ms 211792 KB Output is correct
6 Correct 105 ms 211792 KB Output is correct
7 Correct 102 ms 211728 KB Output is correct
8 Correct 104 ms 211640 KB Output is correct
9 Correct 107 ms 211992 KB Output is correct
10 Correct 108 ms 211788 KB Output is correct
11 Correct 107 ms 211792 KB Output is correct
12 Correct 108 ms 211768 KB Output is correct
13 Correct 114 ms 211796 KB Output is correct
14 Correct 106 ms 211604 KB Output is correct
15 Correct 115 ms 211796 KB Output is correct
16 Correct 106 ms 211780 KB Output is correct
17 Correct 112 ms 211792 KB Output is correct
18 Correct 107 ms 211572 KB Output is correct
19 Correct 111 ms 211836 KB Output is correct
20 Correct 105 ms 211796 KB Output is correct
21 Correct 108 ms 211932 KB Output is correct
22 Correct 107 ms 211792 KB Output is correct
23 Correct 113 ms 212032 KB Output is correct
24 Correct 107 ms 211796 KB Output is correct
25 Correct 107 ms 211796 KB Output is correct
26 Correct 102 ms 211792 KB Output is correct
27 Correct 109 ms 211796 KB Output is correct
28 Correct 108 ms 211796 KB Output is correct
29 Correct 110 ms 211692 KB Output is correct
30 Correct 102 ms 211764 KB Output is correct
31 Correct 106 ms 211940 KB Output is correct
32 Correct 100 ms 211788 KB Output is correct
33 Correct 103 ms 211928 KB Output is correct
34 Correct 106 ms 211624 KB Output is correct
35 Correct 107 ms 211796 KB Output is correct
36 Correct 110 ms 211796 KB Output is correct
37 Correct 102 ms 211796 KB Output is correct
38 Correct 107 ms 211780 KB Output is correct
39 Correct 108 ms 211844 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 211796 KB Output is correct
2 Correct 103 ms 211804 KB Output is correct
3 Correct 105 ms 211568 KB Output is correct
4 Correct 105 ms 211792 KB Output is correct
5 Correct 106 ms 211792 KB Output is correct
6 Correct 105 ms 211792 KB Output is correct
7 Correct 102 ms 211728 KB Output is correct
8 Correct 104 ms 211640 KB Output is correct
9 Correct 107 ms 211992 KB Output is correct
10 Correct 108 ms 211788 KB Output is correct
11 Correct 107 ms 211792 KB Output is correct
12 Correct 108 ms 211768 KB Output is correct
13 Correct 114 ms 211796 KB Output is correct
14 Correct 106 ms 211604 KB Output is correct
15 Correct 115 ms 211796 KB Output is correct
16 Correct 106 ms 211780 KB Output is correct
17 Correct 112 ms 211792 KB Output is correct
18 Correct 107 ms 211572 KB Output is correct
19 Correct 111 ms 211836 KB Output is correct
20 Correct 105 ms 211796 KB Output is correct
21 Correct 108 ms 211932 KB Output is correct
22 Correct 107 ms 211792 KB Output is correct
23 Correct 113 ms 212032 KB Output is correct
24 Correct 107 ms 211796 KB Output is correct
25 Correct 107 ms 211796 KB Output is correct
26 Correct 102 ms 211792 KB Output is correct
27 Correct 109 ms 211796 KB Output is correct
28 Correct 108 ms 211796 KB Output is correct
29 Correct 110 ms 211692 KB Output is correct
30 Correct 102 ms 211764 KB Output is correct
31 Correct 106 ms 211940 KB Output is correct
32 Correct 100 ms 211788 KB Output is correct
33 Correct 103 ms 211928 KB Output is correct
34 Correct 106 ms 211624 KB Output is correct
35 Correct 107 ms 211796 KB Output is correct
36 Correct 110 ms 211796 KB Output is correct
37 Correct 102 ms 211796 KB Output is correct
38 Correct 107 ms 211780 KB Output is correct
39 Correct 108 ms 211844 KB Output is correct
40 Correct 115 ms 212160 KB Output is correct
41 Correct 115 ms 214356 KB Output is correct
42 Correct 112 ms 213408 KB Output is correct
43 Correct 110 ms 213352 KB Output is correct
44 Correct 122 ms 213336 KB Output is correct
45 Correct 128 ms 213320 KB Output is correct
46 Correct 111 ms 213328 KB Output is correct
47 Correct 113 ms 213584 KB Output is correct
48 Correct 114 ms 213328 KB Output is correct
49 Correct 115 ms 213328 KB Output is correct
50 Correct 111 ms 213480 KB Output is correct
51 Correct 110 ms 213588 KB Output is correct
52 Correct 133 ms 213584 KB Output is correct
53 Correct 104 ms 213328 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 211796 KB Output is correct
2 Correct 103 ms 211804 KB Output is correct
3 Correct 105 ms 211568 KB Output is correct
4 Correct 105 ms 211792 KB Output is correct
5 Correct 106 ms 211792 KB Output is correct
6 Correct 105 ms 211792 KB Output is correct
7 Correct 102 ms 211728 KB Output is correct
8 Correct 104 ms 211640 KB Output is correct
9 Correct 107 ms 211992 KB Output is correct
10 Correct 108 ms 211788 KB Output is correct
11 Correct 107 ms 211792 KB Output is correct
12 Correct 108 ms 211768 KB Output is correct
13 Correct 114 ms 211796 KB Output is correct
14 Correct 106 ms 211604 KB Output is correct
15 Correct 115 ms 211796 KB Output is correct
16 Correct 106 ms 211780 KB Output is correct
17 Correct 112 ms 211792 KB Output is correct
18 Correct 107 ms 211572 KB Output is correct
19 Correct 111 ms 211836 KB Output is correct
20 Correct 105 ms 211796 KB Output is correct
21 Correct 108 ms 211932 KB Output is correct
22 Correct 107 ms 211792 KB Output is correct
23 Correct 113 ms 212032 KB Output is correct
24 Correct 107 ms 211796 KB Output is correct
25 Correct 107 ms 211796 KB Output is correct
26 Correct 102 ms 211792 KB Output is correct
27 Correct 109 ms 211796 KB Output is correct
28 Correct 108 ms 211796 KB Output is correct
29 Correct 110 ms 211692 KB Output is correct
30 Correct 102 ms 211764 KB Output is correct
31 Correct 106 ms 211940 KB Output is correct
32 Correct 100 ms 211788 KB Output is correct
33 Correct 103 ms 211928 KB Output is correct
34 Correct 106 ms 211624 KB Output is correct
35 Correct 107 ms 211796 KB Output is correct
36 Correct 110 ms 211796 KB Output is correct
37 Correct 102 ms 211796 KB Output is correct
38 Correct 107 ms 211780 KB Output is correct
39 Correct 108 ms 211844 KB Output is correct
40 Correct 115 ms 212160 KB Output is correct
41 Correct 115 ms 214356 KB Output is correct
42 Correct 112 ms 213408 KB Output is correct
43 Correct 110 ms 213352 KB Output is correct
44 Correct 122 ms 213336 KB Output is correct
45 Correct 128 ms 213320 KB Output is correct
46 Correct 111 ms 213328 KB Output is correct
47 Correct 113 ms 213584 KB Output is correct
48 Correct 114 ms 213328 KB Output is correct
49 Correct 115 ms 213328 KB Output is correct
50 Correct 111 ms 213480 KB Output is correct
51 Correct 110 ms 213588 KB Output is correct
52 Correct 133 ms 213584 KB Output is correct
53 Correct 104 ms 213328 KB Output is correct
54 Correct 126 ms 218016 KB Output is correct
55 Correct 440 ms 272772 KB Output is correct
56 Correct 215 ms 238256 KB Output is correct
57 Correct 187 ms 236116 KB Output is correct
58 Correct 177 ms 235604 KB Output is correct
59 Correct 182 ms 235472 KB Output is correct
60 Correct 206 ms 235348 KB Output is correct
61 Correct 197 ms 236900 KB Output is correct
62 Correct 379 ms 264684 KB Output is correct
63 Correct 189 ms 236372 KB Output is correct
64 Correct 203 ms 237864 KB Output is correct
65 Correct 313 ms 251984 KB Output is correct
66 Correct 305 ms 251728 KB Output is correct
67 Correct 183 ms 235344 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 211796 KB Output is correct
2 Correct 103 ms 211804 KB Output is correct
3 Correct 105 ms 211568 KB Output is correct
4 Correct 105 ms 211792 KB Output is correct
5 Correct 106 ms 211792 KB Output is correct
6 Correct 105 ms 211792 KB Output is correct
7 Correct 102 ms 211728 KB Output is correct
8 Correct 104 ms 211640 KB Output is correct
9 Correct 107 ms 211992 KB Output is correct
10 Correct 108 ms 211788 KB Output is correct
11 Correct 105 ms 211796 KB Output is correct
12 Correct 111 ms 211620 KB Output is correct
13 Correct 1590 ms 424272 KB Output is correct
14 Correct 2049 ms 462068 KB Output is correct
15 Correct 2444 ms 506448 KB Output is correct
16 Correct 2900 ms 558464 KB Output is correct
17 Correct 105 ms 211636 KB Output is correct
18 Incorrect 122 ms 211792 KB Output isn't correct
19 Halted 0 ms 0 KB -