Submission #1265143

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265143		happyboy	Dango Maker (JOI18_dango_maker)	C++20	100 / 100	356 ms	79816 KiB

dango_maker

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

const int N = 3005;
int n, m, cnt[2][N][N];
char a[N][N];

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (a[i][j] == 'G') {
                cnt[0][i][j] = (a[i][j - 1] == 'R' && a[i][j + 1] == 'W');
                cnt[1][i][j] = (a[i - 1][j] == 'R' && a[i + 1][j] == 'W');
                if (cnt[0][i - 1][j + 1] | cnt[1][i - 1][j + 1]) {
                    cnt[0][i][j] &= cnt[0][i - 1][j + 1];
                    cnt[1][i][j] &= cnt[1][i - 1][j + 1];
                }
                ans += (cnt[0][i][j] | cnt[1][i][j]);
            }
        }
    }
    cout << ans << "\n";
}

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