제출 #1115602

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115602		staszic_ojuz	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	592 KiB

dango_maker

#include <iostream>
#include <vector>
using namespace std;
bool odw[3001][3001];
int main()
{
    int n,m;
    cin >> n >> m;
    int wyn=0;
    vector<string> v(n);
    for (int i=0; i<n; i++) cin >> v[i];
    for (int i=0; i<n; i++){
        for (int j=0; j<m; j++){
            if (v[i][j]=='G' and v[max(i-1,0)][j]=='R' and v[min(i+1,n-1)][j]=='W' and v[i][max(j-1,0)]=='R' and v[i][min(j+1,m-1)]=='W' and !odw[i][j] and !odw[max(i-1,0)][j] and !odw[min(i+1,n-1)][j] and !odw[i][max(j-1,0)] and !odw[i][min(j+1,m-1)]){
                odw[i][j]=odw[i+1][j]=odw[i][j+1]=1;
                wyn++;
            }
            else if (v[i][j]=='G' and v[i][max(j-1,0)]=='R' and v[i][min(j+1,m-1)]=='W' and !odw[i][j] and !odw[i][max(j-1,0)] and !odw[i][min(j+1,m-1)]){
                odw[i][j]=odw[i][j-1]=odw[i][j+1]=1;
                wyn++;
            }
            else if (v[i][j]=='G' and v[max(i-1,0)][j]=='R' and v[min(i+1,m-1)][j]=='W' and !odw[i][j] and !odw[max(i-1,0)][j] and !odw[min(i+1,m-1)][j]){
                odw[i][j]=odw[i-1][j]=odw[i+1][j]=1;
                wyn++;
            }
        }
    }
    cout << wyn;
    return 0;
}

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