제출 #44125

#제출 시각아이디문제언어결과실행 시간메모리
44125tlwpdusTents (JOI18_tents)C++11
100 / 100
513 ms71292 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, m;
ll dp[3010][3010], MOD = 1e9+7;

int main() {
    int i, j;

    scanf("%d%d",&n,&m);
    for (i=0;i<=m;i++) dp[0][i] = 1;
    for (i=0;i<=n;i++) dp[i][0] = 1;
    for (i=1;i<=n;i++)for (j=1;j<=m;j++) dp[i][j] = (dp[i-1][j] + dp[i-1][j-1]*4*j%MOD + dp[i-2][j-1]*j*(i-1)%MOD + dp[i-1][j-2]*(1LL*j*(j-1)/2)%MOD ) %MOD;
    printf("%lld\n",(dp[n][m]+MOD-1)%MOD);

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

tents.cpp: In function 'int main()':
tents.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...