제출 #899783

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
899783		ForgottenDestiny	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	756 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;

int dp[6004][3005][3];


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m;
    cin >> n >> m;
    vector<string> graph(n);
    for (int i = 0; i < n; i++) {
        cin >> graph[i];
    }
    vector<vector<pair<int, int>>> skewers(n, vector<pair<int, int>>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (i > 0 && i < n - 1 && graph[i][j] == 'G' && graph[i - 1][j] == 'R' && graph[i + 1][j] == 'W') {
                skewers[i][j].first = 1;
            }
            if (j > 0 && j < m - 1 && graph[i][j] == 'G' && graph[i][j - 1] == 'R' && graph[i][j + 1] == 'W') {
                skewers[i][j].second = 1;
            }
        }
    }
    for (int j = 0; j < n + m - 1; j++) {
        int curx = min(j, m-1);
        int cury = j - curx;
        while (curx >= 0 && cury < n) {
            if (skewers[cury][curx].first == 1) {
                int last = 0;
                if (cury == 0) {
                    last = 0;
                } else {
                    last = max({dp[j][cury - 1][0], dp[j][cury - 1][1], dp[j][cury - 1][2]});
                }
                if((cury>0&&curx<m-1&&graph[cury-1][curx+1]=='G')||(cury==0)||(curx==m-1)){
                    dp[j][cury][0] = max(dp[j][cury][0], last);
                } else {
                    dp[j][cury][0] = max(dp[j][cury][0], last+1);                    
                }
                if (cury == 0) {
                    last = 0;
                } else {
                    last = max({dp[j][cury - 1][0], dp[j][cury - 1][1]});
                }
                dp[j][cury][1] = max(dp[j][cury][1], last + 1);
                if(cury>0) dp[j][cury][2]=max(dp[j][cury][2],dp[j][cury-1][2]);
            } else{
                if(cury>0) {
                    dp[j][cury][0]=max(dp[j][cury][0],dp[j][cury-1][0]);
                    dp[j][cury][1]=max(dp[j][cury][1],dp[j][cury-1][1]);
                    dp[j][cury][2]=max(dp[j][cury][2],dp[j][cury-1][2]);
                }
            }
            if (skewers[cury][curx].second == 1) {
                int last;
                if (cury == 0) {
                    last = 0;
                } else {
                    last = max({dp[j][cury - 1][0], dp[j][cury - 1][1], dp[j][cury - 1][2]});
                }
                if((cury>0&&curx<m-1&&graph[cury-1][curx+1]=='G')||(cury==0)||(curx==m-1)){
                    dp[j][cury][0] = max(dp[j][cury][0], last);
                } else {
                    dp[j][cury][0] = max(dp[j][cury][0], last+1);                    
                }
                if (cury == 0) {
                    last = 0;
                } else {
                    last = max({dp[j][cury - 1][0], dp[j][cury - 1][2]});
                }
                dp[j][cury][2] = max(dp[j][cury][2], last + 1);
                if(cury>0) dp[j][cury][1]=max(dp[j][cury][1],dp[j][cury-1][1]);
            } else{
                if(cury>0) {
                    dp[j][cury][0]=max(dp[j][cury][0],dp[j][cury-1][0]);
                    dp[j][cury][1]=max(dp[j][cury][1],dp[j][cury-1][1]);
                    dp[j][cury][2]=max(dp[j][cury][2],dp[j][cury-1][2]);
                }
            }
            cury++;
            curx--;
        }
    }
    long long res = 0;
    int lol = 0;
    for (int i = 0; i < n + m - 1; i++) {
        res = res+max({dp[i][lol][0], dp[i][lol][1], dp[i][lol][2]});
        lol = min(lol + 1, n-1);
    }
    cout << res << "\n";
}

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