Submission #1102104

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102104		_8_8_	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	2552 KiB

dango_maker

    #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 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67