제출 #532531

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532531		rk42745417	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	316 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(0);
using ll = int64_t;
using uint = uint32_t;
using ull = uint64_t;
using ld = long double;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-8;
const ll LINF = ll(4e18) + ll(2e15);
static int LamyIsCute = []() {
	EmiliaMyWife
	return 48763;
}();

signed main() {
	int n, m;
	cin >> n >> m;
	vector<string> arr(n);
	for(int i = 0; i < n; i++)
		cin >> arr[i];

	vector<vector<bool>> ver(n, vector<bool>(m)), hor = ver;
	for(int i = 0; i + 2 < n; i++)
		for(int j = 0; j < m; j++)
			if(arr[i][j] == 'R' && arr[i + 1][j] == 'G' && arr[i + 2][j] == 'W')
				ver[i][j] = ver[i + 1][j] = ver[i + 2][j] = true;
	for(int i = 0; i < n; i++)
		for(int j = 0; j + 2 < m; j++)
			if(arr[i][j] == 'R' && arr[i][j + 1] == 'G' && arr[i][j + 2] == 'W')
				hor[i][j] = hor[i][j + 1] = hor[i][j + 2] = true;

	int ans = 0;
	vector<vector<bool>> used(n, vector<bool>(m));
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			if(j + 2 < m && arr[i][j] == 'R' && arr[i][j + 1] == 'G' && arr[i][j + 2] == 'W') {
				if(ver[i][j + 2])
					continue;
				if(ver[i][j] && (ver[i][j + 1] - (i + 1 < n && hor[i + 1][j]) - (i + 1 < n && hor[i + 2][j]) > 0))
					continue;
				used[i][j] = used[i][j + 1] = used[i][j + 2] = true;
				ans++;
			}
			if(i >= 2 && arr[i][j] == 'W' && ver[i][j] && !used[i][j] && !used[i - 1][j] && !used[i - 2][j])
				ans++;
		}
	}
	cout << ans << '\n';
}

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