제출 #1281791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281791		Jawad_Akbar_JJ	Tents (JOI18_tents)	C++20	0 / 100	956 ms	589356 KiB

tents

#include <iostream>
#include <vector>

using namespace std;
#define int long long
const int N = 5005;
int seen[N][N], dp[N][N], ch[N][N], fac[N], inv[N], mod = 1e9 + 7, Ans;

int calc(int n, int m){
    if (n == 0 or m == 0)
        return 1;
    if (seen[n][m])
        return dp[n][m];

    seen[n][m] = seen[m][n] = 1;
    dp[n][m] = dp[m][n] = (calc(n-1, m) + m * 4 * calc(n-1, m-1)) % mod;
    return dp[n][m];
}

int n, m;
void get(int a, int b){
    if (a + b + b > n or a + a + b > m)
        return;
    Ans += ch[n][a] * ch[m][2 * a] % mod * ch[n-a][2 * b] % mod * ch[m-2*a][b] % mod * fac[2 * a] % mod * fac[2 * b] % mod * inv[a + b] % mod * calc(n - a - b - b, m - a - a - b) % mod;// % mod;
}

signed main(){
    inv[N-1] = 105853511;
    for (int i=N-2;i>=0;i--)
        inv[i] = inv[i+1] * 2 % mod;

    for (int i=1;i<N;i++){
        for (int j=ch[i-1][0]=1;j<N;j++)
            ch[i][j] = (ch[i-1][j-1] + ch[i-1][j]) % mod;
    }

    for (int i=fac[0]=1;i<N;i++)
        fac[i] = fac[i-1] * i % mod;

    calc(N-1, N-1);

    cin>>n>>m;

    for (int a = 0;a <= n; a++){
        for (int b = 0;a + b + b <= n and a + a + b <= m;b++)
            get(a, b);
    }
    cout<<(Ans - 1 + mod) % mod<<endl;
}

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