Submission #1364762

#TimeUsernameProblemLanguageResultExecution timeMemory
1364762kawhietDango Maker (JOI18_dango_maker)C++20
100 / 100
99 ms10404 KiB
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 47
#endif

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<string> s(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
    }
    auto is = [&](int i, int j, char c) {
        return i >= 0 && i < n && j >= 0 && j < m && s[i][j] == c;
    };
    int ans = 0;
    vector<vector<int>> dp(m + 1, vector<int>(3));
    for (int i = 0; i <= n + m - 4; i++) {
        int k = min(m, i + 2);
        for (int j = 0; j < k; j++) {
            dp[j + 1][0] = max({dp[j][0], dp[j][1], dp[j][2]});
            if (is(i - j + 1, j - 1, 'R') && is(i - j + 1, j, 'G') && is(i - j + 1, j + 1, 'W')) {
                dp[j + 1][1] = max(dp[j][0], dp[j][1]) + 1;
            } else {
                dp[j + 1][1] = 0;
            }
            if (is(i - j, j, 'R') && is(i - j + 1, j, 'G') && is(i - j + 2, j, 'W')) {
                dp[j + 1][2] = max(dp[j][0], dp[j][2]) + 1;
            } else {
                dp[j + 1][2] = 0;
            }
        }
        ans += max({dp[k][0], dp[k][1], dp[k][2]});
    }
    cout << ans << '\n';
    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...