Submission #153454

#TimeUsernameProblemLanguageResultExecution timeMemory
153454AlexLuchianovDango Maker (JOI18_dango_maker)C++14
13 / 100
3 ms376 KiB
#include <iostream>

using namespace std;

#define ll long long
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 3000;
char v[5 + nmax][5 + nmax];

int main()
{
  int n, m;
  cin >> n >> m;
  for(int i = 1;i <= n; i++)
    for(int j = 1;j <= m; j++)
      cin >> v[i][j];
  int result = 0;
  for(int i = 1;i <= n; i++)
    for(int j = 1; j <= m; j++) {
      if(v[i][j] == 'R' && v[i][j + 1] == 'G' && v[i][j + 2] == 'W') {
        result++;
        v[i][j] = v[i][j + 1] = v[i][j + 2] = 0;
      }
      if(v[i][j] == 'R' && v[i + 1][j] == 'G' && v[i + 2][j] == 'W'){
        result++;
        v[i][j] = v[i + 1][j] = v[i + 2][j] = 0;
      }
    }
  cout << result;

  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...