제출 #719748

#제출 시각아이디문제언어결과실행 시간메모리
719748vjudge1Dango Maker (JOI18_dango_maker)C++17
0 / 100
1 ms304 KiB
#include <iostream>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    char arr[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> arr[i][j];
        }
    }
    int count = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m-2; j++) {
            if(arr[i][j] == 'R' && arr[i][j+1] == 'G' && arr[i][j+2] == 'W') {
                count++;
            }
        }
    }
    for(int i = 0; i < n-2; i++) {
        for(int j = 0; j < m; j++) {
            if(arr[i][j] == 'R' && arr[i+1][j] == 'G' && arr[i+2][j] == 'W') {
                count++;
            }
        }
    }
    cout << count << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...