oj.uz

Submission #119983

# Submission time Handle Problem Language Result Execution time Memory
119983 2019-06-22T20:53:28 Z tutis Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
75 / 100
 500 ms 87624 KB 
/*input
20
YYGYYYGGGGRGYYGRGRYG
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
unordered_map<bitset<1203>, int>M;
int dp(bitset<1203>s, int x, int n)
{
	s[1200] = (x == 0);
	s[1201] = (x == 1);
	s[1202] = (x == 2);
	if (n == 1)
	{
		if (s[x * 400])
			return 0;
		else
			return 1e8 + 5;
	}
	if (M.count(s))
		return M[s];
	for (int i = n - 1; i >= 0; i--)
	{
		if (s[x * 400 + i])
		{
			bitset<1203>ss = s;
			ss[x * 400 + i] = false;
			for (int j = i; j + 1 < n; j++)
			{
				ss[000 + j] = ss[000 + j + 1];
				ss[400 + j] = ss[400 + j + 1];
				ss[800 + j] = ss[800 + j + 1];
			}
			for (int y = 0; y <= 2; y++)
				ss[400 * y + n - 1] = false;
			int cost = (n - 1) - i;
			int mini = 3e8;
			for (int y = 0; y <= 2; y++)
			{
				if (x != y)
				{
					mini = min(mini, dp(ss, y, n - 1));
				}
			}
			return M[s] = cost + mini;
		}
	}
	return M[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<1203>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 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 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 384 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 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 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 384 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 15 ms 3072 KB Output is correct
19 Correct 15 ms 2944 KB Output is correct
20 Correct 15 ms 2632 KB Output is correct
21 Correct 17 ms 3140 KB Output is correct
22 Correct 9 ms 2048 KB Output is correct
23 Correct 15 ms 3072 KB Output is correct
24 Correct 9 ms 1920 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 9 ms 1992 KB Output is correct
28 Correct 16 ms 3200 KB Output is correct
29 Correct 16 ms 3072 KB Output is correct
30 Correct 15 ms 2944 KB Output is correct
31 Correct 16 ms 2944 KB Output is correct
32 Correct 15 ms 2944 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 3 ms 768 KB Output is correct
35 Correct 11 ms 2304 KB Output is correct
36 Correct 14 ms 2944 KB Output is correct
37 Correct 11 ms 2276 KB Output is correct
38 Correct 11 ms 2304 KB Output is correct
39 Correct 15 ms 3172 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 3 ms 740 KB Output is correct
3 Correct 3 ms 744 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 3 ms 740 KB Output is correct
6 Correct 3 ms 740 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 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 384 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 15 ms 3072 KB Output is correct
19 Correct 15 ms 2944 KB Output is correct
20 Correct 15 ms 2632 KB Output is correct
21 Correct 17 ms 3140 KB Output is correct
22 Correct 9 ms 2048 KB Output is correct
23 Correct 15 ms 3072 KB Output is correct
24 Correct 9 ms 1920 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 9 ms 1992 KB Output is correct
28 Correct 16 ms 3200 KB Output is correct
29 Correct 16 ms 3072 KB Output is correct
30 Correct 15 ms 2944 KB Output is correct
31 Correct 16 ms 2944 KB Output is correct
32 Correct 15 ms 2944 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 3 ms 768 KB Output is correct
35 Correct 11 ms 2304 KB Output is correct
36 Correct 14 ms 2944 KB Output is correct
37 Correct 11 ms 2276 KB Output is correct
38 Correct 11 ms 2304 KB Output is correct
39 Correct 15 ms 3172 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 3 ms 740 KB Output is correct
44 Correct 3 ms 744 KB Output is correct
45 Correct 3 ms 768 KB Output is correct
46 Correct 3 ms 740 KB Output is correct
47 Correct 3 ms 740 KB Output is correct
48 Correct 3 ms 768 KB Output is correct
49 Correct 2 ms 768 KB Output is correct
50 Correct 3 ms 768 KB Output is correct
51 Correct 3 ms 768 KB Output is correct
52 Correct 3 ms 768 KB Output is correct
53 Correct 2 ms 512 KB Output is correct
54 Correct 3 ms 640 KB Output is correct
55 Correct 3 ms 640 KB Output is correct
56 Correct 3 ms 768 KB Output is correct
57 Correct 3 ms 768 KB Output is correct
58 Execution timed out 1055 ms 87624 KB Time limit exceeded
59 Halted 0 ms 0 KB -