제출 #1289633

#제출 시각아이디문제언어결과실행 시간메모리
1289633ey00Dango Maker (JOI18_dango_maker)C++20
13 / 100
1 ms580 KiB
#include <bits/stdc++.h> #define int long long using namespace std; char c[3000][3001]; bool a[3000][3000]; signed main(){ int n,m; cin>>n>>m; for(int i=0;i<n;i++) for(int j=0;j<m;j++) cin>>c[i][j]; int ans=0; for(int i=0;i<n;i++){ for(int j=0;j+2<m;j++){ if(!a[i][j] && !a[i][j+1] && !a[i][j+2] && c[i][j]=='R' && c[i][j+1]=='G' && c[i][j+2]=='W'){ a[i][j]=a[i][j+1]=a[i][j+2]=true; ans++; } } } for(int j=0;j<m;j++){ for(int i=0;i+2<n;i++){ if(!a[i][j] && !a[i+1][j] && !a[i+2][j] && c[i][j]=='R' && c[i+1][j]=='G' && c[i+2][j]=='W'){ a[i][j]=a[i+1][j]=a[i+2][j]=true; ans++; } } } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...