Submission #206422

#	Time	Username	Problem	Language	Result	Execution time	Memory
206422		E869120	Dango Maker (JOI18_dango_maker)	C++14	33 / 100	2072 ms	19064 KiB

dango_maker

#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	int H, W;
	cin >> H >> W;
	vector<string> S(H);
	for (int i = 0; i < H; ++i) {
		cin >> S[i];
	}
	int ans = 0;
	for (int i = 0; i <= H + W - 4; ++i) {
		vector<int> seq(2 * H);
		for (int j = 0; j < H; ++j) {
			int x = j, y = i - j;
			if (y < 0 || y >= W) continue;
			if (x <= H - 3 && S[x][y] == 'R' && S[x + 1][y] == 'G' && S[x + 2][y] == 'W') {
				seq[(H - x - 1) * 2 - 1] = 1;
			}
			if (y <= W - 3 && S[x][y] == 'R' && S[x][y + 1] == 'G' && S[x][y + 2] == 'W') {
				seq[(H - x - 1) * 2] = 1;
			}
		}
		vector<int> dp(8);
		for (int j = 0; j < 2 * H; ++j) {
			vector<int> ndp(8);
			for (int k = 0; k < 8; ++k) {
				ndp[(k << 1) & 7] = max(ndp[(k << 1) & 7], dp[k]);
				if (seq[j] == 1 && !(k & 1) && (j % 2 == 0 || !(k & 4))) {
					ndp[((k << 1) | 1) & 7] = max(ndp[((k << 1) | 1) & 7], dp[k] + 1);
				}
			}
			dp = ndp;
		}
		ans += *max_element(dp.begin(), dp.end());
	}
	cout << ans << endl;
	return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 20 / 20
• Subtask 3: 0 / 67