Submission #1238113

#TimeUsernameProblemLanguageResultExecution timeMemory
1238113vicvicDango Maker (JOI18_dango_maker)C++20
13 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; const int NMAX=3e3; string a[NMAX+5]; int n, m, used[NMAX+5][NMAX+5]; int main () { ios_base :: sync_with_stdio (0); cin.tie (nullptr); cin >> n >> m; for (int i=0;i<n;i++) cin >> a[i]; int ans=0; for (int i=0;i<n;i++) { for (int j=0;j<m;j++) { if (a[i][j]!='R') continue; if (j<m-2 && used[i][j+1]+used[i][j+2]==0 && a[i][j+1]=='G' && a[i][j+2]=='W') ans++; else if (i<n-2 && a[i+1][j]=='G' && a[i+2][j]=='W' && used[i+1][j]+used[i+2][j]==0) { if (j<m-2 && a[i+1][j-1]=='R' && a[i+1][j+1]=='W' && !used[i+1][j+1]) used[i+1][j]=1; else used[i+2][j]=1; ans++; } } } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...