| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 898440 | penguin133 | Dango Maker (JOI18_dango_maker) | C++17 | 1 ms | 2396 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
char A[3005][3005];
int used[3005][3005], n, m;
void solve(){
cin >> n >> m;
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin >> A[i][j];
int ans = 0;
for(int i=1;i<=n;i++){
for(int j=m;j>=1;j--){
if(A[i][j] == 'G' || used[i][j])continue;
if(A[i][j] == 'R'){
if(i + 2 > n)continue;
if(A[i+1][j] == 'G' && A[i+2][j] == 'W')used[i+1][j] = used[i][j] = used[i+2][j] = 1, ans++;
}
else{
if(j <= 2)continue;
if(A[i][j-1] == 'G' && A[i][j-2] == 'R')used[i][j-2] = used[i][j-1] = used[i][j] = 1, ans++;
}
}
}
cout << ans;
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
