제출 #491547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491547		Joo	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	269 ms	123992 KiB

dango_maker

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

const int N = 3e3+10;

char ta[N][N];
int dp[N][N][3], R, C;

int main(void){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> R >> C;
    for(int i = 1; i <= R; i++){
        for(int j = 1; j <= C; j++){
            cin >> ta[i][j];
        }
    }
    
    int ans = 0;
    for(int i = 1; i <= R; i++){
        for(int j = 1; j <= C; j++){
            dp[i][j][0] = max({dp[i-1][j+1][0], dp[i-1][j+1][1], dp[i-1][j+1][2]});
            if(ta[i][j-1] == 'R' and ta[i][j] == 'G' and ta[i][j+1] == 'W') dp[i][j][1] = 1 + max(dp[i-1][j+1][0], dp[i-1][j+1][1]);
            if(ta[i-1][j] == 'R' and ta[i][j] == 'G' and ta[i+1][j] == 'W') dp[i][j][2] = 1 + max(dp[i-1][j+1][0], dp[i-1][j+1][2]);

            if(j == 1 or i == R) ans += max({dp[i][j][0], dp[i][j][1], dp[i][j][2]});
        }
    }

    cout << ans << "\n";
    return 0;
}

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