Submission #749582

#	Time	Username	Problem	Language	Result	Execution time	Memory
749582		tch1cherin	Dango Maker (JOI18_dango_maker)	C++17	0 / 100	1 ms	300 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, M;
  cin >> N >> M;
  vector<string> s(N);
  for (auto &v : s) {
    cin >> v;
  }
  int ans = 0;
  for (int m = 0; m < min(N, M); m++) {
    for (int i = m; i < N; i++) {
      int j = m;
      if (s[i][j] == 'W') {
        if (i >= 2 && s[i - 1][j] == 'G' && s[i - 2][j] == 'R') {
          ans++;
          s[i][j] = s[i - 1][j] = s[i - 2][j] = '*'; 
        }
        if (j >= 2 && s[i][j - 1] == 'G' && s[i][j - 2] == 'R') {
          ans++;
          s[i][j] = s[i][j - 1] = s[i][j - 2] = '*';
        }
      }
    }
    for (int j = m; j < M; j++) {
      int i = m;
      if (s[i][j] == 'W') {
        if (i >= 2 && s[i - 1][j] == 'G' && s[i - 2][j] == 'R') {
          ans++;
          s[i][j] = s[i - 1][j] = s[i - 2][j] = '*'; 
        }
        if (j >= 2 && s[i][j - 1] == 'G' && s[i][j - 2] == 'R') {
          ans++;
          s[i][j] = s[i][j - 1] = s[i][j - 2] = '*';
        }
      }
    }
  }
  cout << ans << "\n";
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67