# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77946 | aquablitz11 | Dango Maker (JOI18_dango_maker) | C++14 | 2 ms | 784 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;
const int N = 3010;
char S[N][N];
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i)
scanf(" %s", S[i]);
int cnt = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (S[i][j] == 'R' && S[i][j+1] == 'G' && S[i][j+2] == 'W') {
++cnt;
S[i][j] = S[i][j+1] = S[i][j+2] = '\0';
}
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (S[i][j] == 'R' && S[i+1][j] == 'G' && S[i+2][j] == 'W') {
++cnt;
S[i][j] = S[i+1][j] = S[i+2][j] = '\0';
}
}
}
printf("%d\n", cnt);
return 0;
}
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... |