oj.uz

Submission #459548

# Submission time Handle Problem Language Result Execution time Memory
459548 2021-08-08T15:57:59 Z TeaTime Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
60 / 100
 500 ms 972192 KB 
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef int ll;
typedef long double ld;

const ll K = 410, INF = 1e9;

ll n;
ll dp[K][K][K][3], pnlty[K][K][K][3];
ll cnt[3];
ll pos[3][K];
tuple<ll, ll, ll> prefCnt[K];

int main() {
	fastInp;

	cin >> n;
	string s;
	cin >> s;
	
	int i = 1;
	for (auto &c : s) {
		if (c == 'R') c = 0;
		if (c == 'G') c = 1;
		if (c == 'Y') c = 2;
		cnt[c]++;
		pos[c][cnt[c]] = i;
		prefCnt[i] = { cnt[0], cnt[1], cnt[2] };
		i++;
	}

	for (int i = 0; i < K; i++) {
		for (int j = 0; j < K; j++) {
			for (int k = 0; k < K; k++) {
				for (int t = 0; t < 3; t++) dp[i][j][k][t] = INF;
			}
		}
	}

	dp[0][0][0][0] = 0;
	dp[0][0][0][1] = 0;
	dp[0][0][0][2] = 0;
	for (int i = 0; i <= cnt[0]; i++) {
		for (int j = 0; j <= cnt[1]; j++) {
			for (int k = 0; k <= cnt[2]; k++) {
				for (int t = 0; t < 3; t++) {
					ll ind;
					
					if (t == 0) {
						ind = pos[t][i + 1];
						ll b = max(0, get<1>(prefCnt[ind]) - j);
						ll c = max(0, get<2>(prefCnt[ind]) - k);
						pnlty[i][j][k][t] = b + c;
					} else if (t == 1) {
						ind = pos[t][j + 1];
						ll a = max(0, get<0>(prefCnt[ind]) - i);
						ll c = max(0, get<2>(prefCnt[ind]) - k);
						pnlty[i][j][k][t] = a + c;
					} else {
						ind = pos[t][k + 1];
						ll a = max(0, get<0>(prefCnt[ind]) - i);
						ll b = max(0, get<1>(prefCnt[ind]) - j);
						pnlty[i][j][k][t] =  a + b;
					}
				}
			}
		}
	}

	for (int i = 0; i <= cnt[0]; i++) {
		for (int j = 0; j <= cnt[1]; j++) {
			for (int k = 0; k <= cnt[2]; k++) {
				for (int t = 0; t < 3; t++) {
					for (int add = 0; add < 3; add++) {
						if (add == t) continue;
						ll cnt = dp[i][j][k][t] + pnlty[i][j][k][add];
						if (add == 0) {
							dp[i + 1][j][k][add] = min(dp[i + 1][j][k][add], cnt);
						} else if (add == 1) {
							dp[i][j + 1][k][add] = min(dp[i][j + 1][k][add], cnt);
						} else {
							dp[i][j][k + 1][add] = min(dp[i][j][k + 1][add], cnt);
						}
					}
				}
			}
		}
	}
	ll a = INF;
	for (int i = 0; i < 3; i++) a = min(a, dp[cnt[0]][cnt[1]][cnt[2]][i]);
	
	if (a >= INF) {
		cout << "-1\n";
	} else {
		cout << a;
	}

	return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:39:7: warning: array subscript has type 'char' [-Wchar-subscripts]
   39 |   cnt[c]++;
      |       ^
joi2019_ho_t3.cpp:40:7: warning: array subscript has type 'char' [-Wchar-subscripts]
   40 |   pos[c][cnt[c]] = i;
      |       ^
joi2019_ho_t3.cpp:40:14: warning: array subscript has type 'char' [-Wchar-subscripts]
   40 |   pos[c][cnt[c]] = i;
      |              ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 809460 KB Output is correct
2 Correct 416 ms 809528 KB Output is correct
3 Correct 424 ms 809464 KB Output is correct
4 Correct 417 ms 809636 KB Output is correct
5 Correct 420 ms 809632 KB Output is correct
6 Correct 424 ms 809672 KB Output is correct
7 Correct 429 ms 809624 KB Output is correct
8 Correct 424 ms 809688 KB Output is correct
9 Correct 411 ms 809828 KB Output is correct
10 Correct 421 ms 809848 KB Output is correct
11 Correct 419 ms 809768 KB Output is correct
12 Correct 419 ms 809676 KB Output is correct
13 Correct 420 ms 809552 KB Output is correct
14 Correct 425 ms 809796 KB Output is correct
15 Correct 424 ms 809624 KB Output is correct
16 Correct 422 ms 809624 KB Output is correct
17 Correct 426 ms 809508 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 809460 KB Output is correct
2 Correct 416 ms 809528 KB Output is correct
3 Correct 424 ms 809464 KB Output is correct
4 Correct 417 ms 809636 KB Output is correct
5 Correct 420 ms 809632 KB Output is correct
6 Correct 424 ms 809672 KB Output is correct
7 Correct 429 ms 809624 KB Output is correct
8 Correct 424 ms 809688 KB Output is correct
9 Correct 411 ms 809828 KB Output is correct
10 Correct 421 ms 809848 KB Output is correct
11 Correct 419 ms 809768 KB Output is correct
12 Correct 419 ms 809676 KB Output is correct
13 Correct 420 ms 809552 KB Output is correct
14 Correct 425 ms 809796 KB Output is correct
15 Correct 424 ms 809624 KB Output is correct
16 Correct 422 ms 809624 KB Output is correct
17 Correct 426 ms 809508 KB Output is correct
18 Correct 417 ms 811552 KB Output is correct
19 Correct 426 ms 811152 KB Output is correct
20 Correct 411 ms 811516 KB Output is correct
21 Correct 419 ms 811628 KB Output is correct
22 Correct 424 ms 810928 KB Output is correct
23 Correct 419 ms 811348 KB Output is correct
24 Correct 422 ms 810892 KB Output is correct
25 Correct 423 ms 813224 KB Output is correct
26 Correct 425 ms 813364 KB Output is correct
27 Correct 455 ms 812328 KB Output is correct
28 Correct 423 ms 811556 KB Output is correct
29 Correct 422 ms 811532 KB Output is correct
30 Correct 435 ms 811456 KB Output is correct
31 Correct 461 ms 811384 KB Output is correct
32 Correct 432 ms 811596 KB Output is correct
33 Correct 419 ms 813132 KB Output is correct
34 Correct 432 ms 812736 KB Output is correct
35 Correct 451 ms 811860 KB Output is correct
36 Correct 436 ms 811168 KB Output is correct
37 Correct 418 ms 810948 KB Output is correct
38 Correct 430 ms 811340 KB Output is correct
39 Correct 420 ms 811568 KB Output is correct
40 Correct 424 ms 809620 KB Output is correct
41 Correct 425 ms 811440 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 426 ms 809540 KB Output is correct
2 Correct 486 ms 972164 KB Output is correct
3 Correct 487 ms 971348 KB Output is correct
4 Execution timed out 508 ms 972192 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 809460 KB Output is correct
2 Correct 416 ms 809528 KB Output is correct
3 Correct 424 ms 809464 KB Output is correct
4 Correct 417 ms 809636 KB Output is correct
5 Correct 420 ms 809632 KB Output is correct
6 Correct 424 ms 809672 KB Output is correct
7 Correct 429 ms 809624 KB Output is correct
8 Correct 424 ms 809688 KB Output is correct
9 Correct 411 ms 809828 KB Output is correct
10 Correct 421 ms 809848 KB Output is correct
11 Correct 419 ms 809768 KB Output is correct
12 Correct 419 ms 809676 KB Output is correct
13 Correct 420 ms 809552 KB Output is correct
14 Correct 425 ms 809796 KB Output is correct
15 Correct 424 ms 809624 KB Output is correct
16 Correct 422 ms 809624 KB Output is correct
17 Correct 426 ms 809508 KB Output is correct
18 Correct 417 ms 811552 KB Output is correct
19 Correct 426 ms 811152 KB Output is correct
20 Correct 411 ms 811516 KB Output is correct
21 Correct 419 ms 811628 KB Output is correct
22 Correct 424 ms 810928 KB Output is correct
23 Correct 419 ms 811348 KB Output is correct
24 Correct 422 ms 810892 KB Output is correct
25 Correct 423 ms 813224 KB Output is correct
26 Correct 425 ms 813364 KB Output is correct
27 Correct 455 ms 812328 KB Output is correct
28 Correct 423 ms 811556 KB Output is correct
29 Correct 422 ms 811532 KB Output is correct
30 Correct 435 ms 811456 KB Output is correct
31 Correct 461 ms 811384 KB Output is correct
32 Correct 432 ms 811596 KB Output is correct
33 Correct 419 ms 813132 KB Output is correct
34 Correct 432 ms 812736 KB Output is correct
35 Correct 451 ms 811860 KB Output is correct
36 Correct 436 ms 811168 KB Output is correct
37 Correct 418 ms 810948 KB Output is correct
38 Correct 430 ms 811340 KB Output is correct
39 Correct 420 ms 811568 KB Output is correct
40 Correct 424 ms 809620 KB Output is correct
41 Correct 425 ms 811440 KB Output is correct
42 Correct 426 ms 809540 KB Output is correct
43 Correct 486 ms 972164 KB Output is correct
44 Correct 487 ms 971348 KB Output is correct
45 Execution timed out 508 ms 972192 KB Time limit exceeded
46 Halted 0 ms 0 KB -