| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1289557 | topraksenn | Dango Maker (JOI18_dango_maker) | C++20 | 2 ms | 580 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main(){
int n,m;
cin>>n>>m;
string a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int sonuc=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(j+2<m&&a[i][j]=='R'&&a[i][j+1]=='G'&&a[i][j+2]=='W'){
sonuc++;
a[i][j]='.';
a[i][j+1]='.';
a[i][j+2]='.';
}
if(i+2<n&&a[i][j]=='R'&&a[i+1][j]=='G'&&a[i+2][j]=='W'){
sonuc++;
a[i][j]='.';
a[i+1][j]='.';
a[i+2][j]='.';
}
}
}
cout<<sonuc;
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... | ||||
