oj.uz

Submission #887935

# Submission time Handle Problem Language Result Execution time Memory
887935 2023-12-15T14:13:58 Z hafo Dango Maker (JOI18_dango_maker) C++14
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 3e3 + 7;
const ll oo = 1e18 + 69;

int n, m;
char a[maxn][maxn];
bool used[maxn][maxn];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    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 <= min(n, m); i++) {
        for(int j = i; j <= m - 2; j++) {
            if(used[i][j]) continue;
            if(a[i][j] == 'R' && a[i][j + 1] == 'G' && a[i][j + 2] == 'W') {
                ans++;
                used[i][j] = 1;
            }
        }

        for(int j = i; j <= n - 2; j++) {
            if(used[j][i]) continue;
            if(a[j][i] == 'R' && a[j + 1][i] == 'G' && a[j + 2][i] == 'W') {
                ans++;
                used[j][i] = 1;
            }
        } 
    }

    for(int i = 1; i <= min(n, m); i++) {
        for(int j = i; j <= m; j++) {
            if(used[i][j]) continue;
            if(i + 2 <= n && a[i][j] == 'R' && a[i + 1][j] == 'G' && a[i + 2][j] == 'W') {
                ans++;
                used[i][j] = 1;
            }
        }

        for(int j = i; j <= n; j++) {
            if(used[j][i]) continue;
            if(i + 2 <= m && a[j][i] == 'R' && a[j][i + 1] == 'G' && a[j][i + 2] == 'W') {
                ans++;
                used[j][i] = 1;
            }
        } 
    }
    cout<<ans;
    return 0;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Incorrect 0 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Incorrect 0 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Incorrect 0 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -