oj.uz

답안 #874876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874876 2023-11-18T03:07:50 Z NK_ Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 1844 ms 398316 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back

#define f first
#define s second
#define mp make_pair

#define sz(x) int(x.size())

using pi = pair<int, int>;
using ll = long long;

template<class T> using V = vector<T>;

using vi = V<int>;
using vl = V<ll>;
using vpi = V<pi>;
using str = string;

const int MOD = 1e9 + 7;
const int base = 1009;
const ll INFL = ll(2e18);
const int LG = 18;

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int N; cin >> N;
	str S; cin >> S;

	ll a, b, c; cin >> a >> b >> c;

	V<vl> dp(N, vl(N, INFL));
	V<vi> nxt(N, vi(N, -1));

	for(int l = 0; l < N; l++) for(int r = l; r < N; r++) dp[l][r] = (r - l + 1) * a;

	V<unordered_map<ll, int>> C(N);
	V<V<vi>> H(N);

	for(int l = 0; l < N; l++) {
		ll h = 0; 
		for(int w = 0; l + w < N; w++) {
			h = (base * h + S[l + w]) % MOD;

			// cout << l << " " << w << " " << h << endl;

			if (C[w].find(h) == C[w].end()) C[w][h] = sz(H[w]), H[w].pb({});

			H[w][C[w][h]].pb(l);
		}
	}

	for(int w = 0; w < N; w++) {
		// cout << w << endl;
		for(auto& v : H[w]) {
			// for(auto& x : v) cout << x << " ";
			// cout << endl;

			v.pb(-1);
			int j = sz(v) - 1;
			for(int i = sz(v) - 2; i >= 0; i--) {
				while(j - 1 >= 0 && v[i] + w < v[j - 1]) j--;
				nxt[v[i]][v[i] + w] = v[j];
			}
		}
		// cout << endl;
	}

	for(int l = 0; l < N; l++) for(int r = l; r < N; r++) {
		if (nxt[l][r] >= MOD) nxt[l][r] = -1;
		// cout << l << " " << r << " " << nxt[l][r] << endl;
	}


	for(int w = 0; w < N; w++) {
		for(int l = 0; l + w < N; l++) {
			int r = l + w;
			
			if (r-1 >= 0) dp[l][r] = min(dp[l][r], dp[l][r-1] + a);
			if (l+1 < N) dp[l][r] = min(dp[l][r], dp[l+1][r] + a);

			// cout << l << " " << r << " " << dp[l][r] << endl;

			int L = l, amt = 1;
			while(nxt[L][L + w] != -1) {
				L = nxt[L][L + w], amt++;
				int left = (L + w - l + 1) - (l + w - l + 1) * amt;
				dp[l][L + w] = min(dp[l][L + w], dp[l][r] + b + c * amt + left * a);
				// cout << l << " " << l + w << " " << L << " " << L + w << " => " << dp[l][L + w] << endl;
			}
		}
	}

	cout << dp[0][N-1] << nl;

	exit(0-0);
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 216 ms 49620 KB Output is correct
4 Correct 261 ms 57508 KB Output is correct
5 Correct 362 ms 67156 KB Output is correct
6 Correct 430 ms 79044 KB Output is correct
7 Correct 531 ms 92768 KB Output is correct
8 Correct 523 ms 92500 KB Output is correct
9 Correct 537 ms 92548 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 356 KB Output is correct
18 Correct 0 ms 352 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 1 ms 356 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 0 ms 352 KB Output is correct
23 Correct 0 ms 392 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 352 KB Output is correct
32 Correct 0 ms 352 KB Output is correct
33 Correct 0 ms 356 KB Output is correct
34 Correct 0 ms 356 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 356 KB Output is correct
39 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 356 KB Output is correct
18 Correct 0 ms 352 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 1 ms 356 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 0 ms 352 KB Output is correct
23 Correct 0 ms 392 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 352 KB Output is correct
32 Correct 0 ms 352 KB Output is correct
33 Correct 0 ms 356 KB Output is correct
34 Correct 0 ms 356 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 356 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 864 KB Output is correct
41 Correct 1 ms 1124 KB Output is correct
42 Correct 4 ms 3020 KB Output is correct
43 Correct 4 ms 2912 KB Output is correct
44 Correct 6 ms 3020 KB Output is correct
45 Correct 4 ms 3168 KB Output is correct
46 Correct 4 ms 3168 KB Output is correct
47 Correct 2 ms 1376 KB Output is correct
48 Correct 3 ms 2140 KB Output is correct
49 Correct 4 ms 2428 KB Output is correct
50 Correct 4 ms 2396 KB Output is correct
51 Correct 3 ms 2140 KB Output is correct
52 Correct 3 ms 2140 KB Output is correct
53 Correct 4 ms 2952 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 356 KB Output is correct
18 Correct 0 ms 352 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 1 ms 356 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 0 ms 352 KB Output is correct
23 Correct 0 ms 392 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 352 KB Output is correct
32 Correct 0 ms 352 KB Output is correct
33 Correct 0 ms 356 KB Output is correct
34 Correct 0 ms 356 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 356 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 864 KB Output is correct
41 Correct 1 ms 1124 KB Output is correct
42 Correct 4 ms 3020 KB Output is correct
43 Correct 4 ms 2912 KB Output is correct
44 Correct 6 ms 3020 KB Output is correct
45 Correct 4 ms 3168 KB Output is correct
46 Correct 4 ms 3168 KB Output is correct
47 Correct 2 ms 1376 KB Output is correct
48 Correct 3 ms 2140 KB Output is correct
49 Correct 4 ms 2428 KB Output is correct
50 Correct 4 ms 2396 KB Output is correct
51 Correct 3 ms 2140 KB Output is correct
52 Correct 3 ms 2140 KB Output is correct
53 Correct 4 ms 2952 KB Output is correct
54 Correct 21 ms 13144 KB Output is correct
55 Correct 43 ms 15192 KB Output is correct
56 Correct 184 ms 63320 KB Output is correct
57 Correct 170 ms 64016 KB Output is correct
58 Correct 167 ms 64080 KB Output is correct
59 Correct 166 ms 64164 KB Output is correct
60 Correct 185 ms 64256 KB Output is correct
61 Correct 101 ms 34544 KB Output is correct
62 Correct 44 ms 15708 KB Output is correct
63 Correct 157 ms 53076 KB Output is correct
64 Correct 163 ms 52852 KB Output is correct
65 Correct 117 ms 39872 KB Output is correct
66 Correct 114 ms 40024 KB Output is correct
67 Correct 166 ms 64220 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 216 ms 49620 KB Output is correct
14 Correct 261 ms 57508 KB Output is correct
15 Correct 362 ms 67156 KB Output is correct
16 Correct 430 ms 79044 KB Output is correct
17 Correct 531 ms 92768 KB Output is correct
18 Correct 523 ms 92500 KB Output is correct
19 Correct 537 ms 92548 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 356 KB Output is correct
35 Correct 0 ms 352 KB Output is correct
36 Correct 0 ms 356 KB Output is correct
37 Correct 1 ms 356 KB Output is correct
38 Correct 0 ms 352 KB Output is correct
39 Correct 0 ms 352 KB Output is correct
40 Correct 0 ms 392 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 352 KB Output is correct
49 Correct 0 ms 352 KB Output is correct
50 Correct 0 ms 356 KB Output is correct
51 Correct 0 ms 356 KB Output is correct
52 Correct 0 ms 604 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 0 ms 356 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 864 KB Output is correct
58 Correct 1 ms 1124 KB Output is correct
59 Correct 4 ms 3020 KB Output is correct
60 Correct 4 ms 2912 KB Output is correct
61 Correct 6 ms 3020 KB Output is correct
62 Correct 4 ms 3168 KB Output is correct
63 Correct 4 ms 3168 KB Output is correct
64 Correct 2 ms 1376 KB Output is correct
65 Correct 3 ms 2140 KB Output is correct
66 Correct 4 ms 2428 KB Output is correct
67 Correct 4 ms 2396 KB Output is correct
68 Correct 3 ms 2140 KB Output is correct
69 Correct 3 ms 2140 KB Output is correct
70 Correct 4 ms 2952 KB Output is correct
71 Correct 21 ms 13144 KB Output is correct
72 Correct 43 ms 15192 KB Output is correct
73 Correct 184 ms 63320 KB Output is correct
74 Correct 170 ms 64016 KB Output is correct
75 Correct 167 ms 64080 KB Output is correct
76 Correct 166 ms 64164 KB Output is correct
77 Correct 185 ms 64256 KB Output is correct
78 Correct 101 ms 34544 KB Output is correct
79 Correct 44 ms 15708 KB Output is correct
80 Correct 157 ms 53076 KB Output is correct
81 Correct 163 ms 52852 KB Output is correct
82 Correct 117 ms 39872 KB Output is correct
83 Correct 114 ms 40024 KB Output is correct
84 Correct 166 ms 64220 KB Output is correct
85 Correct 630 ms 160588 KB Output is correct
86 Correct 1844 ms 396380 KB Output is correct
87 Correct 1799 ms 398256 KB Output is correct
88 Correct 1794 ms 398316 KB Output is correct
89 Incorrect 1807 ms 398160 KB Output isn't correct
90 Halted 0 ms 0 KB -