| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1289595 | ey00 | Dango Maker (JOI18_dango_maker) | C++20 | 1 ms | 584 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
char c[3000][3000];
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
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 cnt=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(j+2<m && c[i][j]=='R' && c[i][j+1]=='G' && c[i][j+2]=='W'){
cnt++;
c[i][j]=c[i][j+1]=c[i][j+2]='A';
j+=2;
continue;
}
if(i+2<n && c[i][j]=='R' && c[i+1][j]=='G' && c[i+2][j]=='W'){
cnt++;
c[i][j]=c[i+1][j]=c[i+2][j]='A';
}
}
}
cout<<cnt;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
