# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
206752 | pavement | Dango Maker (JOI18_dango_maker) | C++17 | 5 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N, M, C;
char F[3005][3005];
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> M;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
cin >> F[i][j];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M - 2; j++)
if (F[i][j] == 'R' && F[i][j + 1] == 'G' && F[i][j + 2] == 'W') {
C++;
F[i][j] = F[i][j + 1] = F[i][j + 2] = 0;
}
for (int j = 1; j <= M; j++)
for (int i = 1; i <= N - 2; i++)
if (F[i][j] == 'R' && F[i + 1][j] == 'G' && F[i + 2][j] == 'W') {
F[i][j] = F[i + 1][j] = F[i + 2][j] = 0;
C++;
}
cout << C << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |