oj.uz

Submission #1004035

# Submission time Handle Problem Language Result Execution time Memory
1004035 2024-06-21T02:58:27 Z ByeWorld Tents (JOI18_tents) C++14
100 / 100
 113 ms 71032 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 3e3+10;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
int sum(int a, int b){
	return (a+b)%MOD;
}
int mul(int a, int b){
	return (a*b)%MOD;
}
int expo(int a, int b){
	if(b==0) return 1;
	int te = expo(a, b/2); te = mul(te, te);
	return (b%2 ? mul(te, a) : te); 
}
void chsum(int &a, int b){
	a = (a+b)%MOD;
}
void chmul(int &a, int b){
	a = (a*b)%MOD;
}

int h, w;
int dp[MAXN][MAXN];

signed main(){
	// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> h >> w;
	for(int i=0; i<=h; i++) dp[i][0] = 1;
	for(int i=0; i<=w; i++) dp[0][i] = 1;

	for(int i=1; i<=h; i++){ // occupied rows
		for(int j=1; j<=w; j++){ // occupied column
			dp[i][j] = dp[i][j-1]; // gk pake column terkiri
			if(i>=2) chsum(dp[i][j], mul(i*(i-1)/2, dp[i-2][j-1]));
			if(j>=2) chsum(dp[i][j], mul(mul(i, j-1), dp[i-1][j-2]));
			chsum(dp[i][j], mul(mul(4, i), dp[i-1][j-1]));
			// cout << i << ' ' << j << ' ' << dp[i][j] << " pp\n";
		}
	}
	cout << (dp[h][w]+MOD-1)%MOD << '\n';
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 4556 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 4556 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 5 ms 55644 KB Output is correct
15 Correct 69 ms 66240 KB Output is correct
16 Correct 5 ms 6492 KB Output is correct
17 Correct 16 ms 16984 KB Output is correct
18 Correct 19 ms 29276 KB Output is correct
19 Correct 88 ms 70212 KB Output is correct
20 Correct 71 ms 59992 KB Output is correct
21 Correct 45 ms 39576 KB Output is correct
22 Correct 46 ms 51800 KB Output is correct
23 Correct 29 ms 70412 KB Output is correct
24 Correct 113 ms 71032 KB Output is correct
25 Correct 87 ms 62040 KB Output is correct
26 Correct 93 ms 68184 KB Output is correct
27 Correct 109 ms 70232 KB Output is correct