제출 #1289603

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289603		hasandas	Dango Maker (JOI18_dango_maker)	C++20	13 / 100	2 ms	584 KiB

dango_maker

#include <bits/stdc++.h>

using namespace std;


int main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);

    long long n, m;
    cin >> n >> m;

    vector<string> v(n);

    for (long long i = 0; i < n; i++) {
        cin >> v[i];
    }

    long long ans = 0;

    for (long long freq = 0; freq < 2; ++freq) {
        for (long long q = 0; q < 2; ++q) {
            for (long long cf = 0; cf < 2; ++cf) {
                vector<vector<char>> a(n, vector<char>(m, 0));
                long long notans = 0;

                if (freq) {
                    if (q) {
                        for (long long i = 0; i < n; ++i) {
                            for (long long j = 0; j + 2 < m; ++j) {
                                if (!a[i][j] && !a[i][j+1] && !a[i][j+2] && v[i][j]=='R' && v[i][j+1]=='G' && v[i][j+2]=='W') {
                                    a[i][j]=a[i][j+1]=a[i][j+2]=1;

                                    ++notans;
                                }
                            }
                        }
                    }
                    else {
                        for (long long i = 0; i < n; ++i) {
                            for (long long j = m - 3; j >= 0; --j) {
                                if (!a[i][j] && !a[i][j+1] && !a[i][j+2]&& v[i][j]=='R' && v[i][j+1]=='G' && v[i][j+2]=='W') {
                                    a[i][j]=a[i][j+1]=a[i][j+2]=1;

                                    ++notans;
                                }
                            }
                        }
                    }

                    if (cf) {
                        for (long long j = 0; j < m; ++j) {
                            for (long long i = 0; i + 2 < n; ++i) {
                                if (!a[i][j] && !a[i+1][j] && !a[i+2][j]&& v[i][j]=='R' && v[i+1][j]=='G' && v[i+2][j]=='W') {
                                    a[i][j]=a[i+1][j]=a[i+2][j]=1;

                                    ++notans;
                                }
                            }
                        }
                    }
                    else {
                        for (long long j = 0; j < m; ++j) {
                            for (long long i = n - 3; i >= 0; --i) {
                                if (!a[i][j] && !a[i+1][j] && !a[i+2][j]&& v[i][j]=='R' && v[i+1][j]=='G' && v[i+2][j]=='W') {
                                    a[i][j]=a[i+1][j]=a[i+2][j]=1;

                                    ++notans;
                                }
                            }
                        }
                    }
                }
                else {
                    if (cf) {
                        for (long long j = 0; j < m; ++j) {
                            for (long long i = 0; i + 2 < n; ++i) {
                                if (!a[i][j] && !a[i+1][j] && !a[i+2][j]&& v[i][j]=='R' && v[i+1][j]=='G' && v[i+2][j]=='W') {
                                    a[i][j]=a[i+1][j]=a[i+2][j]=1;

                                    ++notans;
                                }
                            }
                        }
                    }
                    else {
                        for (long long j = 0; j < m; ++j) {
                            for (long long i = n - 3; i >= 0; --i) {
                                if (!a[i][j] && !a[i+1][j] && !a[i+2][j] && v[i][j]=='R' && v[i+1][j]=='G' && v[i+2][j]=='W') {
                                    a[i][j]=a[i+1][j]=a[i+2][j]=1;

                                    ++notans;
                                }
                            }
                        }
                    }

                    if (q) {
                        for (long long i = 0; i < n; ++i) {
                            for (long long j = 0; j + 2 < m; ++j) {
                                if (!a[i][j] && !a[i][j+1] && !a[i][j+2] && v[i][j]=='R' && v[i][j+1]=='G' && v[i][j+2]=='W') {
                                    a[i][j]=a[i][j+1]=a[i][j+2]=1;

                                    ++notans;
                                }
                            }
                        }
                    }
                    else {
                        for (long long i = 0; i < n; ++i) {
                            for (long long j = m - 3; j >= 0; --j) {
                                if (!a[i][j] && !a[i][j+1] && !a[i][j+2] && v[i][j]=='R' && v[i][j+1]=='G' && v[i][j+2]=='W') {
                                    a[i][j]=a[i][j+1]=a[i][j+2]=1;

                                    ++notans;
                                }
                            }
                        }
                    }
                }

                if (notans > ans) {
                    ans = notans;

                }
            }
        }
    }

    cout << ans << "\n";

    return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67