oj.uz

답안 #949285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949285 2024-03-19T04:57:40 Z mansur Tents (JOI18_tents) C++17
100 / 100
 112 ms 70840 KB 
//#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) a.size()
#define pf push_front
#define pb push_back
#define vt vector
#define s second
#define f first
#define nl '\n'
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
vt<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vt<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 1e6 + 5, mod = 1e9 + 7;

const ll inf = 1e9;
 
double eps = 1e-15;
                        
bool fl = 0;

void slv() {
	int n, m;
	cin >> n >> m;
	ll dp[n + 1][m + 1];
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= m; j++) {
			dp[i][j] = (!i || !j);
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			dp[i][j] = (dp[i - 1][j - 1] * 4 * j) % mod;
			dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod;
			if (j > 1) dp[i][j] = (dp[i][j] + dp[i - 1][j - 2] * j * (j - 1) / 2) % mod;
			if (i > 1) dp[i][j] = (dp[i][j] + dp[i - 2][j - 1] * j * (i - 1)) % mod;	
		}
	}
	cout << dp[n][m] - 1;
}   
 
int main() {
	//freopen("shops.in", "r", stdin);                                                                                     
	//freopen("shops.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);                                                                                       
	cin.tie(0);
	int tp = 1;
	if (fl) cin >> tp;
	while (tp--) {
		slv();
	}
}

Subtask #1
48.0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct

Subtask #2
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 69 ms 44124 KB Output is correct
16 Correct 5 ms 3164 KB Output is correct
17 Correct 15 ms 9988 KB Output is correct
18 Correct 19 ms 12380 KB Output is correct
19 Correct 81 ms 51284 KB Output is correct
20 Correct 65 ms 41052 KB Output is correct
21 Correct 42 ms 27224 KB Output is correct
22 Correct 42 ms 26716 KB Output is correct
23 Correct 23 ms 15192 KB Output is correct
24 Correct 112 ms 70840 KB Output is correct
25 Correct 82 ms 52680 KB Output is correct
26 Correct 97 ms 60384 KB Output is correct
27 Correct 106 ms 68188 KB Output is correct