oj.uz

Submission #142696

# Submission time Handle Problem Language Result Execution time Memory
142696 2019-08-10T14:25:48 Z DrumpfTheGodEmperor Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
60 / 100
 500 ms 764840 KB 
#include <bits/stdc++.h>
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) freopen((string(s) + "." + end1).c_str(), "r", stdin),\
		freopen((string(s) + "." + end2).c_str(), "w", stdout);
#define fi first
#define se second
#define bw(i, r, l) for (int i = r - 1; i >= l; i--)
#define fw(i, l, r) for (int i = l; i < r; i++)
#define fa(i, x) for (auto i: x)
using namespace std;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
const int N = 405;
int n, dp[N][N][N][3], cntPrefix[N][3];
string s;
vector<int> reds, greens, yellows;
int getRealPosition(int ogPos, int prvRed, int prvGreen, int prvYellow) {
	//prvRed - cntPrefix[ogPos][0] is the number of reds that are moved to before ogPos
	int ans = 0;
	ans += max(0, prvRed - cntPrefix[ogPos][0]);
	ans += max(0, prvGreen - cntPrefix[ogPos][1]);
	ans += max(0, prvYellow - cntPrefix[ogPos][2]);
	return ogPos + ans + 1; //Difference between array indices and dp indices.
}
signed main() {
	#ifdef BLU
	in("blu.inp");
	#endif
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> s;
	fw (i, 0, s.length()) {
		if (s[i] == 'R') reds.pb(i);
		else if (s[i] == 'G') greens.pb(i);
		else yellows.pb(i);
	}
	//0: red, 1: green, 2: yellow
	fw (i, 0, s.length()) {
		fw (color, 0, 3) cntPrefix[i][color] = (i ? cntPrefix[i - 1][color] : 0);
		if (s[i] == 'R') cntPrefix[i][0]++;
		else if (s[i] == 'G') cntPrefix[i][1]++;
		else cntPrefix[i][2]++;
	}
	fw (i, 1, n + 1) fw (j, 0, n + 1) fw (k, 0, n + 1) fw (l, 0, 3) dp[i][j][k][l] = inf;
	//dp(i, r, g, color): Minimal cost for the first i items, j reds and k greens, i - j - k yellows. The
	//last leave is colored "color".
	if (reds.size() > 0) dp[1][1][0][0] = reds[0];
	if (greens.size() > 0) dp[1][0][1][1] = greens[0];
	if (yellows.size() > 0) dp[1][0][0][2] = yellows[0];
	fw (i, 2, n + 1) fw (r, 0, min(i, (int)reds.size()) + 1) fw (g, 0, min(i - r, (int)greens.size()) + 1)
																					fw (color, 0, 3) {
//		cout << "dp[" << i << "][" << r << "][" << g << "][" << color << "]\n";
		fw (prvColor, 0, 3) if (prvColor != color) {
			int newr = r, newg = g;
			if (color == 0) newr--;
			if (color == 1) newg--;
			if (newr < 0 || newg < 0 || i - 1 - newr - newg < 0) continue;
//			cout << i - 1 << " " << newr << " " << newg << " " << prvColor << " dp = " << dp[i - 1][newr][newg][prvColor] << "\n";
			dp[i][r][g][color] = min(dp[i][r][g][color], dp[i - 1][newr][newg][prvColor]);
		}
		if (dp[i][r][g][color] == inf) continue; //Non - valid state
		int y = i - r - g;
		if (y > yellows.size()) continue;
//		cout << "valid state have dp = " << dp[i][r][g][color] << "\n";
		if (color == 0 && r > 0) {
			dp[i][r][g][color] += getRealPosition(reds[r - 1], r - 1, g, y) - i;
		}
		if (color == 1 && g > 0) {
			dp[i][r][g][color] += getRealPosition(greens[g - 1], r, g - 1, y) - i;
//			if (i == 2 && r == 1 && g == 1 && color == 1) {
//				cout << "getRealPos of " << greens[g - 1] << " is " << getRealPosition(greens[g - 1], r, g - 1, y) << "\n";
//				cout << "+= " << getRealPosition(greens[g - 1], r, g - 1, y) - i << "\n";
//			}
		}
		if (color == 2 && y > 0) {
			dp[i][r][g][color] += getRealPosition(yellows[y - 1], r, g, y - 1) - i;
		}
//		cout << "dp[" << i << "][" << r << "][" << g << "][" << color << "] = " << dp[i][r][g][color] << "\n";
	}
	int ans = inf;
	fw (color, 0, 3) ans = min(ans, dp[n][reds.size()][greens.size()][color]);
	if (ans == inf) cout << "-1";
	else cout << ans;
	return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:11:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fw(i, l, r) for (int i = l; i < r; i++)
joi2019_ho_t3.cpp:34:6:
  fw (i, 0, s.length()) {
      ~~~~~~~~~~~~~~~~                  
joi2019_ho_t3.cpp:34:2: note: in expansion of macro 'fw'
  fw (i, 0, s.length()) {
  ^~
joi2019_ho_t3.cpp:11:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fw(i, l, r) for (int i = l; i < r; i++)
joi2019_ho_t3.cpp:40:6:
  fw (i, 0, s.length()) {
      ~~~~~~~~~~~~~~~~                  
joi2019_ho_t3.cpp:40:2: note: in expansion of macro 'fw'
  fw (i, 0, s.length()) {
  ^~
joi2019_ho_t3.cpp:65:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (y > yellows.size()) continue;
       ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 3 ms 1404 KB Output is correct
9 Correct 3 ms 1400 KB Output is correct
10 Correct 3 ms 1400 KB Output is correct
11 Correct 3 ms 1400 KB Output is correct
12 Correct 3 ms 1400 KB Output is correct
13 Correct 3 ms 1400 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 3 ms 1400 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 3 ms 1404 KB Output is correct
9 Correct 3 ms 1400 KB Output is correct
10 Correct 3 ms 1400 KB Output is correct
11 Correct 3 ms 1400 KB Output is correct
12 Correct 3 ms 1400 KB Output is correct
13 Correct 3 ms 1400 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 3 ms 1400 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 16 ms 17784 KB Output is correct
19 Correct 16 ms 17756 KB Output is correct
20 Correct 16 ms 17784 KB Output is correct
21 Correct 16 ms 17784 KB Output is correct
22 Correct 16 ms 17784 KB Output is correct
23 Correct 16 ms 17784 KB Output is correct
24 Correct 16 ms 17784 KB Output is correct
25 Correct 17 ms 17784 KB Output is correct
26 Correct 17 ms 17780 KB Output is correct
27 Correct 16 ms 17784 KB Output is correct
28 Correct 16 ms 17800 KB Output is correct
29 Correct 16 ms 17784 KB Output is correct
30 Correct 16 ms 17784 KB Output is correct
31 Correct 16 ms 17784 KB Output is correct
32 Correct 16 ms 17800 KB Output is correct
33 Correct 16 ms 17144 KB Output is correct
34 Correct 16 ms 17144 KB Output is correct
35 Correct 15 ms 16632 KB Output is correct
36 Correct 15 ms 17272 KB Output is correct
37 Correct 14 ms 15992 KB Output is correct
38 Correct 16 ms 17812 KB Output is correct
39 Correct 16 ms 17784 KB Output is correct
40 Correct 15 ms 17144 KB Output is correct
41 Correct 16 ms 17736 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB Output is correct
2 Execution timed out 921 ms 764840 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 3 ms 1404 KB Output is correct
9 Correct 3 ms 1400 KB Output is correct
10 Correct 3 ms 1400 KB Output is correct
11 Correct 3 ms 1400 KB Output is correct
12 Correct 3 ms 1400 KB Output is correct
13 Correct 3 ms 1400 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 3 ms 1400 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 16 ms 17784 KB Output is correct
19 Correct 16 ms 17756 KB Output is correct
20 Correct 16 ms 17784 KB Output is correct
21 Correct 16 ms 17784 KB Output is correct
22 Correct 16 ms 17784 KB Output is correct
23 Correct 16 ms 17784 KB Output is correct
24 Correct 16 ms 17784 KB Output is correct
25 Correct 17 ms 17784 KB Output is correct
26 Correct 17 ms 17780 KB Output is correct
27 Correct 16 ms 17784 KB Output is correct
28 Correct 16 ms 17800 KB Output is correct
29 Correct 16 ms 17784 KB Output is correct
30 Correct 16 ms 17784 KB Output is correct
31 Correct 16 ms 17784 KB Output is correct
32 Correct 16 ms 17800 KB Output is correct
33 Correct 16 ms 17144 KB Output is correct
34 Correct 16 ms 17144 KB Output is correct
35 Correct 15 ms 16632 KB Output is correct
36 Correct 15 ms 17272 KB Output is correct
37 Correct 14 ms 15992 KB Output is correct
38 Correct 16 ms 17812 KB Output is correct
39 Correct 16 ms 17784 KB Output is correct
40 Correct 15 ms 17144 KB Output is correct
41 Correct 16 ms 17736 KB Output is correct
42 Correct 2 ms 424 KB Output is correct
43 Execution timed out 921 ms 764840 KB Time limit exceeded
44 Halted 0 ms 0 KB -