답안 #370379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
370379	2021-02-23T22:04:41 Z	shivensinha4	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	100 / 100	75 ms	4204 KB

joi2019_ho_t3

#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2")
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
#define endl '\n'

int main() {
#ifdef mlocal
	freopen("test.in", "r", stdin);
#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n; string s; cin >> n >> s;
	
	vi cpos[3];
	int nums[n], dp[2][n+1][n+1][3], t[3], ct[3], cost[3], pref[n][3];
	memset(dp, 0x3f, sizeof(dp)); memset(pref, 0, sizeof(pref));
	
	for_(i, 0, n) {
		if (s[i] == 'G') nums[i] = 1;
		else if (s[i] == 'Y') nums[i] = 2;
		else nums[i] = 0;
		
		cpos[nums[i]].push_back(i);
		pref[i][nums[i]]++;
	}
	
	for_(i, 1, n) for_(j, 0, 3) pref[i][j] += pref[i-1][j];
	
	const int INF = 1e9;
	for_(i, 0, 3) ct[i] = cpos[i].size();
	
	int ans, pos, idx = 1;
	for (int i = n; i >= 0; i--) {
		for (t[0] = 0; t[0] <= min(ct[0], i); t[0]++) for (t[1] = 0; t[1] <= min(ct[1], i-t[0]); t[1]++) {
			t[2] = i-t[0]-t[1];
			if (t[2] > ct[2]) continue;
			for_(c, 0, 3) if (t[c] < ct[c]) {
				pos = cpos[c][t[c]];
				cost[c] = pos - (pos > 0 ? min(pref[pos-1][0], t[0]) + min(pref[pos-1][1], t[1]) + min(pref[pos-1][2], t[2]) : 0);
			}
			
			for_(last, 0, 3) {
				ans = INF;
				if (i == n) ans = (t[0] == ct[0] and t[1] == ct[1] and t[2] == ct[2]) ? 0 : INF;
				else for_(c, 0, 3) if (c != last and ct[c] > t[c]) {
					ans = min(ans, dp[1-idx][t[0]+(c==0)][t[1]+(c==1)][c] + cost[c]);
				}
				
				dp[idx][t[0]][t[1]][last] = ans;
			}
		}
		idx = 1-idx;
	}
	
	ans = min({dp[1-idx][0][0][1], dp[1-idx][0][0][0]});
	
	cout << (ans >= INF ? -1 : ans) << endl;
	
	return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:55:60: warning: 'cost[1]' may be used uninitialized in this function [-Wmaybe-uninitialized]
   55 |      ans = min(ans, dp[1-idx][t[0]+(c==0)][t[1]+(c==1)][c] + cost[c]);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct

Subtask #2
55.0 / 55.0

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

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	13 ms	4076 KB	Output is correct
3	Correct	13 ms	4076 KB	Output is correct
4	Correct	15 ms	4076 KB	Output is correct
5	Correct	18 ms	4076 KB	Output is correct
6	Correct	13 ms	4076 KB	Output is correct
7	Correct	13 ms	4076 KB	Output is correct
8	Correct	13 ms	4076 KB	Output is correct
9	Correct	13 ms	4076 KB	Output is correct
10	Correct	13 ms	4076 KB	Output is correct
11	Correct	13 ms	4076 KB	Output is correct
12	Correct	3 ms	1388 KB	Output is correct
13	Correct	5 ms	2156 KB	Output is correct
14	Correct	8 ms	2924 KB	Output is correct
15	Correct	13 ms	4076 KB	Output is correct
16	Correct	13 ms	4076 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	0 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	13 ms	4076 KB	Output is correct
44	Correct	13 ms	4076 KB	Output is correct
45	Correct	15 ms	4076 KB	Output is correct
46	Correct	18 ms	4076 KB	Output is correct
47	Correct	13 ms	4076 KB	Output is correct
48	Correct	13 ms	4076 KB	Output is correct
49	Correct	13 ms	4076 KB	Output is correct
50	Correct	13 ms	4076 KB	Output is correct
51	Correct	13 ms	4076 KB	Output is correct
52	Correct	13 ms	4076 KB	Output is correct
53	Correct	3 ms	1388 KB	Output is correct
54	Correct	5 ms	2156 KB	Output is correct
55	Correct	8 ms	2924 KB	Output is correct
56	Correct	13 ms	4076 KB	Output is correct
57	Correct	13 ms	4076 KB	Output is correct
58	Correct	56 ms	4076 KB	Output is correct
59	Correct	62 ms	4204 KB	Output is correct
60	Correct	55 ms	4076 KB	Output is correct
61	Correct	55 ms	4096 KB	Output is correct
62	Correct	20 ms	4152 KB	Output is correct
63	Correct	19 ms	4076 KB	Output is correct
64	Correct	36 ms	4076 KB	Output is correct
65	Correct	44 ms	4076 KB	Output is correct
66	Correct	54 ms	4076 KB	Output is correct
67	Correct	53 ms	4076 KB	Output is correct
68	Correct	55 ms	4076 KB	Output is correct
69	Correct	67 ms	4076 KB	Output is correct
70	Correct	56 ms	4204 KB	Output is correct
71	Correct	75 ms	4204 KB	Output is correct
72	Correct	22 ms	4076 KB	Output is correct
73	Correct	6 ms	4076 KB	Output is correct

답안 #370379

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 55.0 / 55.0

Subtask #3 15.0 / 15.0

Subtask #4 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
55.0 / 55.0

Subtask #3
15.0 / 15.0

Subtask #4
25.0 / 25.0