oj.uz

Submission #1102104

# Submission time Handle Problem Language Result Execution time Memory
1102104 2024-10-17T12:48:31 Z _8_8_ Dango Maker (JOI18_dango_maker) C++17
13 / 100
 1 ms 2552 KB 
    #include <bits/stdc++.h>
        
    using namespace std;
        
    typedef long long ll;
        
    const int  N = 3e3 + 12, MOD = 998244353;
     
    char a[N][N], b[N][N];
    int n, m, res = 0, res1 = 0;
    void test() {
        cin >> n >> m;
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= m; j++) {
                cin >> a[i][j];
                b[i][j] = a[i][j];
            }
        }
        for(int i = 1; i <= n; i++) {
            for(int j = 2; j < m; j++) {
                if(a[i][j] == 'G' && a[i][j - 1] == 'R' && a[i][j + 1] == 'W') {
                    res++;
                    a[i][j] = a[i][j - 1] = a[i][j + 1] = '-';
                }
            }
        }
        for(int i = 2; i < n; i++) {
            for(int j = 1; j <= m; j++) {
                if(a[i][j] == 'G' && a[i - 1][j] == 'R' && a[i + 1][j] == 'W') {
                    res++;
                    a[i][j] = a[i - 1][j] = a[i + 1][j] = '-';
                }
            }
        }
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= m; j++) {
                a[i][j] = b[i][j];
            }
        }
        for(int i = 2; i < n; i++) {
            for(int j = 1; j <= m; j++) {
                if(a[i][j] == 'G' && a[i - 1][j] == 'R' && a[i + 1][j] == 'W') {
                    res1++;
                    a[i][j] = a[i - 1][j] = a[i + 1][j] = '-';
                }
            }
        }
        for(int i = 1; i <= n; i++) {
            for(int j = 2; j < m; j++) {
                if(a[i][j] == 'G' && a[i][j - 1] == 'R' && a[i][j + 1] == 'W') {
                    res1++;
                    a[i][j] = a[i][j - 1] = a[i][j + 1] = '-';
                }
            }
        }
        cout << max(res1, res) << '\n';
    }
    int main() {
        ios_base::sync_with_stdio(false);
        cin.tie(0); 
        
        int t = 1; 
        // cin >> t;
        
        while(t--) 
            test();
        
        return 0;
    }

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2520 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2504 KB Output is correct
12 Correct 1 ms 2552 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2520 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2504 KB Output is correct
12 Correct 1 ms 2552 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Incorrect 1 ms 336 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2520 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2504 KB Output is correct
12 Correct 1 ms 2552 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Incorrect 1 ms 336 KB Output isn't correct
21 Halted 0 ms 0 KB -