# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115414 | staszic_ojuz | Dango Maker (JOI18_dango_maker) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<string> plansza;
int64_t 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]++;
tab[i + 1][j] = j + i * 3001;
tab[i + 2][j] = j + i * 3001;
}else{
if(tab[i + 2][j - 1] == 0){
tab[i][j]++;
}
}
}else{
if(tab[i + 2][j] == 0){
tab[i + 2][j] = 0;
}else{
continue;
}
}
}
}
if(j < m - 2 && tab[i][j] == 0){
if(plansza[i][j + 1] == 'G' && plansza[i][j + 2] == 'W'){
tab[i][j]++;
tab[i][j + 1] = j + i * 3001;
tab[i][j + 2] = j + i * 3001;
}
}
wyn += min(1, tab[i][j]);
}
}
}
cout << wyn;
}