제출 #1115663

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

dango_maker

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

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