oj.uz

Submission #119985

# Submission time Handle Problem Language Result Execution time Memory
119985 2019-06-22T21:09:19 Z tutis Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
75 / 100
 500 ms 70240 KB 
/*input
5
RRGYY
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
unordered_map<bitset<1200>, int>M[3];
int dp(bitset<1200>s, int x, int n)
{
	if (M[x].count(s))
		return M[x][s];
	if (n == 1)
	{
		for (int i = 0; i < 400; i++)
			if (s[400 * x + i])
				return M[x][s] = 0;
		return M[x][s] = 1e8 + 5;
	}
	int cost = 0;
	for (int i = 0; i < 400; i++)
	{
		if (s[x * 400 + i])
		{
			bitset<1200>ss = s;
			ss[x * 400 + i] = false;
			int mini = 3e8;
			for (int y = 0; y <= 2; y++)
			{
				if (x != y)
				{
					mini = min(mini, dp(ss, y, n - 1));
				}
			}
			return M[x][s] = cost + mini;
		}
		if (s[i] || s[400 + i] || s[800 + i])
			cost++;
	}
	return M[x][s] = 3e8;
}
int code(char c)
{
	if (c == 'R')
		return 0;
	if (c == 'G')
		return 1;
	return 2;
}
int main()
{
	ios_base::sync_with_stdio(false);
	int n;
	string s;
	cin >> n >> s;
	bitset<1200>ss;
	for (int i = 0; i < n; i++)
	{
		ss[400 * code(s[i]) + i] = true;
	}
	int ans = min({dp(ss, 0, n), dp(ss, 1, n), dp(ss, 2, n)});
	if (ans > 1e8)
		ans = -1;
	cout << ans << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 428 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 428 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 17 ms 2944 KB Output is correct
19 Correct 16 ms 2808 KB Output is correct
20 Correct 17 ms 2816 KB Output is correct
21 Correct 18 ms 3064 KB Output is correct
22 Correct 12 ms 2048 KB Output is correct
23 Correct 18 ms 2936 KB Output is correct
24 Correct 11 ms 1920 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 11 ms 2048 KB Output is correct
28 Correct 19 ms 3104 KB Output is correct
29 Correct 17 ms 3072 KB Output is correct
30 Correct 16 ms 2816 KB Output is correct
31 Correct 16 ms 2688 KB Output is correct
32 Correct 18 ms 2876 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 4 ms 768 KB Output is correct
35 Correct 13 ms 2304 KB Output is correct
36 Correct 15 ms 2760 KB Output is correct
37 Correct 13 ms 2304 KB Output is correct
38 Correct 15 ms 2432 KB Output is correct
39 Correct 18 ms 2996 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 3 ms 640 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 740 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 5 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 4 ms 768 KB Output is correct
9 Correct 4 ms 768 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 4 ms 768 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 4 ms 640 KB Output is correct
14 Correct 4 ms 640 KB Output is correct
15 Correct 5 ms 768 KB Output is correct
16 Correct 4 ms 768 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 428 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 17 ms 2944 KB Output is correct
19 Correct 16 ms 2808 KB Output is correct
20 Correct 17 ms 2816 KB Output is correct
21 Correct 18 ms 3064 KB Output is correct
22 Correct 12 ms 2048 KB Output is correct
23 Correct 18 ms 2936 KB Output is correct
24 Correct 11 ms 1920 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 11 ms 2048 KB Output is correct
28 Correct 19 ms 3104 KB Output is correct
29 Correct 17 ms 3072 KB Output is correct
30 Correct 16 ms 2816 KB Output is correct
31 Correct 16 ms 2688 KB Output is correct
32 Correct 18 ms 2876 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 4 ms 768 KB Output is correct
35 Correct 13 ms 2304 KB Output is correct
36 Correct 15 ms 2760 KB Output is correct
37 Correct 13 ms 2304 KB Output is correct
38 Correct 15 ms 2432 KB Output is correct
39 Correct 18 ms 2996 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 3 ms 640 KB Output is correct
42 Correct 2 ms 384 KB Output is correct
43 Correct 4 ms 740 KB Output is correct
44 Correct 4 ms 768 KB Output is correct
45 Correct 5 ms 768 KB Output is correct
46 Correct 5 ms 768 KB Output is correct
47 Correct 5 ms 768 KB Output is correct
48 Correct 5 ms 768 KB Output is correct
49 Correct 4 ms 768 KB Output is correct
50 Correct 4 ms 768 KB Output is correct
51 Correct 4 ms 768 KB Output is correct
52 Correct 4 ms 768 KB Output is correct
53 Correct 3 ms 512 KB Output is correct
54 Correct 4 ms 640 KB Output is correct
55 Correct 4 ms 640 KB Output is correct
56 Correct 5 ms 768 KB Output is correct
57 Correct 4 ms 768 KB Output is correct
58 Execution timed out 1048 ms 70240 KB Time limit exceeded
59 Halted 0 ms 0 KB -