# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75116 | bogdan10bos | Dango Maker (JOI18_dango_maker) | C++14 | 3 ms | 776 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 FILE_IO
int N, M, ans, sol;
char a[3005][3005];
int f[3005][3005];
int main()
{
#ifdef FILE_IO
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
#endif
scanf("%d%d\n", &N, &M);
for(int i = 1; i <= N; i++)
scanf("%s", a[i] + 1);
for(int i = 1; i <= N; i++)
for(int j = 1; j + 2 <= M; j++)
if(a[i][j] == 'R' && a[i][j + 1] == 'G' && a[i][j + 2] == 'W')
{
ans++;
f[i][j] = f[i][j + 1] = f[i][j + 2] = 1;
}
for(int j = 1; j <= M; j++)
for(int i = 1; i + 2 <= N; i++)
if(a[i][j] == 'R' && a[i + 1][j] == 'G' && a[i + 2][j] == 'W' && f[i][j] != 1 && f[i + 1][j] != 1 && f[i + 2][j] != 1)
{
ans++;
f[i][j] = f[i + 1][j] = f[i + 2][j] = 1;
}
for(int j = 1; j <= M; j++)
for(int i = 1; i + 2 <= N; i++)
if(a[i][j] == 'R' && a[i + 1][j] == 'G' && a[i + 2][j] == 'W')
{
sol++;
f[i][j] = f[i + 1][j] = f[i + 2][j] = 2;
}
for(int i = 1; i <= N; i++)
for(int j = 1; j + 2 <= M; j++)
if(a[i][j] == 'R' && a[i][j + 1] == 'G' && a[i][j + 2] == 'W' && f[i][j] != 2 && f[i][j + 1] != 2 && f[i][j + 2] != 2)
{
sol++;
f[i][j] = f[i][j + 1] = f[i][j + 2] = 2;
}
printf("%d\n", max(ans, sol));
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... |