Submission #1115594

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115594		staszic_ojuz	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	504 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;
    for(int i = 0; i < n; i++){
        string s;
        cin >> s;
        plansza.push_back(s);
    }
    int64_t wyn = 0;
    for(int i = n - 1; i >= 0; i--){
        for(int j = m - 1; j >= 0; j--){
            if(plansza[i][j] == 'R'){
                if(i < n - 2){
                    if(plansza[i + 1][j] == 'G' && plansza[i + 2][j] == 'W'){
                        if(tab[i + 1][j] == 0){
                            if(tab[i + 2][j] == 0){
                                tab[i][j] = 1;
                                tab[i + 1][j] = -1;
                                tab[i + 2][j] = -1;
                            }else{
                                if(tab[i + 2][j - 1] == 0){
                                    tab[i][j] = 1;
                                }
                            }
                        }else{
                            if(tab[i + 2][j] == 0){
                                tab[i + 1][j] = 0;
                            }
                        }

                    }
                }
                if(j < m - 2 && tab[i][j] == 0){
                    if(plansza[i][j + 1] == 'G' && plansza[i][j + 2] == 'W'){
                        tab[i][j] = 1;
                        tab[i][j + 1] = -1;
                        tab[i][j + 2] = -1;
                    }
                }
            }
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            wyn += max(0, tab[i][j]);
        }
    }
    cout << wyn;
}

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