제출 #94005

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94005		brcode	Tents (JOI18_tents)	C++14	100 / 100	116 ms	71040 KiB

tents

#include <iostream>

using namespace std;
long long dp[3010][3010];
const long long mod = 1e9+7;
int main() {
    long long n,m;
    cin>>n>>m;
    for(long long i=0;i<=3010;i++){
        dp[0][i] = 1;
        dp[i][0] = 1;
    }
    for(long long i=1;i<=n;i++){
        for(long long j=1;j<=m;j++){
            
                dp[i][j] = dp[i-1][j];

            dp[i][j] += (4*j*dp[i-1][j-1]);
            dp[i][j]+=mod;
            dp[i][j]%=mod;
            dp[i][j] += ((j*(j-1))/2)*dp[i-1][j-2];
            dp[i][j]+=mod;
            dp[i][j]%=mod;
            dp[i][j] += (j*(i-1))*dp[i-2][j-1];
            dp[i][j]+=mod;
            dp[i][j]%=mod;
        }
    }
    cout<<dp[n][m]-1<<endl;
}

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

tents.cpp: In function 'int main()':
tents.cpp:10:18: warning: iteration 3010 invokes undefined behavior [-Waggressive-loop-optimizations]
         dp[0][i] = 1;
         ~~~~~~~~~^~~
tents.cpp:9:24: note: within this loop
     for(long long i=0;i<=3010;i++){
                       ~^~~~~~

• Subtask 1: 48 / 48
• Subtask 2: 52 / 52