제출 #1153465

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1153465		spycoderyt	Dango Maker (JOI18_dango_maker)	C++20	0 / 100	1 ms	328 KiB

dango_maker

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

const int N = 3005;
int A[N][N],dp[N][N];
int main() {
    int n,m;
    cin>>n>>m;
    for(int i = 1;i<=n;i++) {
        for(int j = 1;j<=m;j++) {
            char c;
            cin>>c;
            if(c=='R')A[i][j]=1;
            else if (c == 'G') A[i][j] = 2;
            else A[i][j] = 3;
        }
    }
    for(int i = 1;i<=n;i++) {
        for(int j = 1;j<=m;j++) {
            // drag 
            // dp[i][j]=min(dp[i][j],1);
            // dp[i][j] += dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1];
            // hor
            int h1 = (A[i][j] == 1 && A[i][j+1] == 2 && A[i][j+2] == 3);
            int h2 = (A[i+1][j] == 1 && A[i+1][j+1] == 2 && A[i+1][j+2] == 3);
            int h3 = (A[i+2][j] == 1 && A[i+2][j+1] == 2 && A[i+2][j+2] == 3);
            int v1 = (A[i][j] == 1 && A[i+1][j] == 2 && A[i+2][j] == 3);
            int v2 = (A[i][j+1] == 1 && A[i+1][j+1] == 2 && A[i+2][j+1] == 3);
            int v3 = (A[i][j+2] == 1 && A[i+1][j+2] == 2 && A[i+2][j+2] == 3);
            if(h1)dp[i][j+2]++;
            if(v1)dp[i+2][j]++;
            dp[i+2][j+2] -= (h1&&v1) + (h2&&v2) + (h3&&v3);
            // dp[i+2][j+2] -= h1 * (v1 + v2 +v3) + v1 * (h1 + h2 + h3) - h1 * v1;
        }
    }

    // for(int i = 1;i<=n;i++) {
    //     for(int j = 1;j<=m;j++) {
    //         cerr << dp[i][j] << " ";
    //     }cerr << "\n";
    // }
    for(int i = 1;i<=n;i++) for(int j = 1;j<=m;j++) {
        dp[i][j] += dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1];
    }
    // for(int i = 1;i<=n;i++) {
    //     for(int j = 1;j<=m;j++) {
    //         cout << dp[i][j] << " ";
    //     }cout << "\n";
    // }
    cout<<dp[n][m];
}

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