Submission #1289608

#TimeUsernameProblemLanguageResultExecution timeMemory
1289608efk44impDango Maker (JOI18_dango_maker)C++20
0 / 100
2 ms576 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n,m; cin >> n >> m; char dizi[n][m]; for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ cin >> dizi[i][j]; } } bool esit[n][m] = {false}; int sayacy = 0; int sayacd = 0; for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ if(j+2 < m){ if(dizi[i][j] == 'R' && dizi[i][j + 1] == 'G' && dizi[i][j + 2] == 'W'){ if(!esit[i][j] && !esit[i][j+1] && !esit[i][j+2]){ sayacy++; esit[i][j] = true, esit[i][j+1] = true, esit[i][j+2] = true; } } } } } for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ if(i+2 < n){ if(dizi[i][j] == 'R' && dizi[i + 1][j] == 'G' && dizi[i + 2][j] == 'W'){ if(!esit[i][j] && !esit[i+1][j] && !esit[i+2][j]){ sayacd++; esit[i][j] = true, esit[i+1][j] = true, esit[i+2][j] = true; } } } } } cout << sayacy + sayacd; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...