제출 #668786

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

dango_maker

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define x first
#define y second
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m;cin>>n>>m;
    vector<vector<char>> v(n,vector<char>(m));
    vector<vector<bool>> vis(n,vector<bool>(m));
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>v[i][j];
        }
    }
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(v[i][j]!='R'){
                continue;
            }
            if(i>1){
                if(v[i-1][j]=='G'&&v[i-2][j]=='W'&&vis[i-1][j]==0&&vis[i-2][j]==0){
                    vis[i][j]=1;
                    vis[i-1][j]=1;
                    vis[i-2][j]=1;
                    ans++;
                    continue;
                }
            }
            if(j>1){
                if(v[i][j-1]=='G'&&v[i][j-2]=='W'&&vis[i][j-1]==0&&vis[i][j-2]==0){
                    vis[i][j]=1;
                    vis[i][j-1]=1;
                    vis[i][j-2]=1;
                    ans++;
                    continue;
                }
            }
            if(j<n-2){
                if(v[i][j+1]=='G'&&v[i][j+2]=='W'&&vis[i][j+1]==0&&vis[i][j+2]==0){
                    vis[i][j]=1;
                    vis[i][j+1]=1;
                    vis[i][j+2]=1;
                    ans++;
                    continue;
                }
            }
            if(i<n-2){
                if(v[i+1][j]=='G'&&v[i+2][j]=='W'&&vis[i+1][j]==0&&vis[i+2][j]==0){
                    vis[i][j]=1;
                    vis[i+1][j]=1;
                    vis[i+2][j]=1;
                    ans++;
                    continue;
                }
            }
        }
    }
    cout<<ans<<endl;

    return 0;
}

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