Submission #1198206

#TimeUsernameProblemLanguageResultExecution timeMemory
1198206aykhnDango Maker (JOI18_dango_maker)C++20
0 / 100
0 ms396 KiB
#include <bits/stdc++.h> using namespace std; #define inf 0x3F3F3F3F const int MXN = 3e3 + 5; char a[MXN][MXN]; int used[MXN][MXN]; void _() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> a[i][j]; auto cr = [&](int x, int y) { if (y + 2 >= m) return false; return a[x][y] == 'R' && a[x][y + 1] == 'G' && a[x][y + 2] == 'W'; }; auto cd = [&](int x, int y) { if (x + 2 >= n) return false; return a[x][y] == 'R' && a[x + 1][y] == 'G' && a[x + 2][y] == 'W'; }; int res = 0; for (int d = 0; d < n + m - 1; d++) { int dp[m][2], ans = 0; for (int i = 0; i < m; i++) dp[i][0] = dp[i][1] = 0; for (int j = m - 1; j >= 0; j--) { int i = d - j; if (i < 0 || i >= n) continue; if (j + 1 < m) { dp[j][0] = dp[j + 1][0]; dp[j][1] = max(dp[j + 1][0], dp[j + 1][1]); } dp[j][0] = max(dp[j][0], (j + 2 < m ? max(dp[j + 2][0], dp[j + 2][1]) : 0)); dp[j][1] = max(dp[j][1], (j + 2 < m ? max(dp[j + 2][0], dp[j + 2][1]) : 0)); dp[j][0] += cr(i, j); dp[j][1] += cd(i, j); ans = max(dp[j][0], dp[j][1]); } res += ans; } cout << res << '\n'; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; // cin >> t; while (t--) _(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...