제출 #1289661

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

dango_maker

#include <bits/stdc++.h>
using namespace std;
#define fori for(int i=0;i<n;i++)
#define forj for(int j=0;j<m;j++)
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m,count=0;
    cin >> n >> m;
    vector<vector<char>> grid(n,vector<char>(m));
    fori
        forj
            cin >> grid[i][j];

    fori{
        for(int j=0; j<=m-3; j++){
            bool r = true;
            for(int k=0;k<3;k++) if(grid[i][j+k]=='x') r=false;
            if(r && grid[i][j]=='R' && grid[i][j+1]=='G' && grid[i][j+2]=='W'){
                count++;
                for(int k=0;k<3;k++) grid[i][j+k]='x';
            }
        }
    }

    forj{
        for(int i=0; i<=n-3; i++){
            bool d=true;
            for(int k=0;k<3;k++) if(grid[i+k][j]=='x') d=false;
            if(d && grid[i][j]=='R' && grid[i+1][j]=='G' && grid[i+2][j]=='W'){
                count++;
                for(int k=0;k<3;k++) grid[i+k][j]='x';
            }
        }
    }

    cout << count;
}

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