Submission #1115647

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115647		staszic_ojuz	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	508 KiB

dango_maker

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

vector<string> plansza;
int tab[3001][3001];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    string str;
    for(int i = 0; i <= m; i++){
        str += "#";
    }
    plansza.push_back(str);
    for(int i = 0; i < n; i++){
        string s;
        cin >> s;
        plansza.push_back("#" + s + "#");
    }
    plansza.push_back(str);
    int64_t wyn = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(plansza[i][j] == 'G'){
                if(plansza[i - 1][j] == 'R' && plansza[i + 1][j] == 'W'){
                    if(plansza[i][j - 1] == 'R' && plansza[i][j + 1] == 'W'){
                        tab[i][j] = 1;
                        plansza[i][j - 1] = '#';
                        plansza[i + 1][j] = '#';
                    }else{
                        tab[i][j] = 1;
                        plansza[i - 1][j] = '#';
                        plansza[i + 1][j] = '#';
                    }
                }else{
                    if(plansza[i][j - 1] == 'R' && plansza[i][j + 1] == 'W'){
                        tab[i][j] = 1;
                        plansza[i][j + 1] = '#';
                        plansza[i][j - 1] = '#';
                    }
                }
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            wyn += tab[i][j];
        }
    }
    cout << wyn;
}

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