제출 #1289712

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

dango_maker

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

int main(){
    int n,m;
    cin>>n>>m;
    vector<string> a(n);
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    if(n<3&&m<3){cout<<0;return 0;}
    if(n>2&&m>2){
        int ans=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if((j<m-2)&&(a[i][j]=='R'&&a[i][j+1]=='G'&&a[i][j+2]=='W')){
                    a[i][j]='C';a[i][j+1]='C';a[i][j+2]='C';ans++;
                }else{
                    if((i<n-2)&&(a[i][j]=='R'&&a[i+1][j]=='G'&&a[i+2][j]=='W')){
                        a[i][j]='C';a[i+1][j]='C';a[i+2][j]='C';ans++;
                    }
                }
            }
        }
        cout<<ans;
        return 0;
    }
    if(n<3&&m>2){
        int ans=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<m-2;j++){
                if(a[i][j]=='R'&&a[i][j+1]=='G'&&a[i][j+2]=='W'){
                    a[i][j]='C';a[i][j+1]='C';a[i][j+2]='C';ans++;
                }
            }
        }
        cout<<ans;
        return 0;
    }
    if(n>2&&m<3){
        int ans=0;
        for(int i=0;i<n-2;i++){
            for(int j=0;j<m;j++){
                if(a[i][j]=='R'&&a[i+1][j]=='G'&&a[i+2][j]=='W'){
                    a[i][j]='C';a[i+1][j]='C';a[i+2][j]='C';ans++;
                }
            }
        }
        cout<<ans;
        return 0;
    }
}

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