제출 #1273107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1273107		trvhung	Tents (JOI18_tents)	C++20	100 / 100	71 ms	35672 KiB

tents

#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>

// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;

// #define   ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define            ll long long
#define           ull unsigned long long
#define            ld long double
#define            pb push_back
#define  bit(mask, i) ((mask >> i) & 1)
#define            el '\n'
#define             F first
#define             S second

template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};

const int N = 3e3 + 5;
int h, w, dp[N][N];

void solve() {
	cin >> h >> w;

	fill(dp[0], dp[0] + 1 + w, 1);
	for (int i = 1; i <= h; ++i)
		dp[i][0] = 1;

	for (int i = 1; i <= h; ++i)
		for (int j = 1; j <= w; ++j) {
			dp[i][j] = dp[i - 1][j];
			(dp[i][j] += 1LL * 4 * j * dp[i - 1][j - 1] % MOD) %= MOD;
			(dp[i][j] += 1LL * (i - 1) * j * dp[i - 2][j - 1] % MOD) %= MOD;
			(dp[i][j] += 1LL * j * (j - 1) / 2 % MOD * dp[i - 1][j - 2] % MOD) %= MOD;
		}

	cout << (dp[h][w] - 1 + MOD) % MOD;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    if (!MULTI) solve();
    else {
        int test; cin >> test;
        while (test--) solve();
    }
    
    return 0;
}

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