제출 #237697

#제출 시각아이디문제언어결과실행 시간메모리
237697blueTents (JOI18_tents)C++11
100 / 100
119 ms70768 KiB
#include <iostream>
using namespace std;

int main()
{
    long long H, W;
    cin >> H >> W;

    long long m = 1000000007;

    long long dp[H+1][W+1];

        for(long long j = 0; j <= W; j++)
        {
            dp[0][j] = 1;
            dp[1][j] = 1 + 4*j + j*(j-1)/2;
        }
    for(long long i = 2; i <= H; i++)
    {
        dp[i][0] = 1;
        dp[i][1] = 1 + 4*i + i*(i-1)/2;
        for(long long j = 2; j <= W; j++)
        {
            dp[i][j] = ((dp[i][j-1] + 4*i * dp[i-1][j-1])%m + (i*(i-1)/2 * dp[i-2][j-1] + i*(j-1) * dp[i-1][j-2])%m)%m;
        }
    }

    cout << dp[H][W] - 1 << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...