oj.uz

답안 #1034135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034135 2024-07-25T10:01:50 Z anHiep Tents (JOI18_tents) C++14
100 / 100
 221 ms 71244 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int mod = 1e9 + 7;

#define int long long
 
int dp[3003][3003];
int dv;
 
int bp(int a, int b){
    if(b == 0) return 1;
    if(b == 1) return a;
    int k = bp(a, b/2);
    k = (k * k) % mod;
    if(b % 2 == 0) return k;
    return (a * k) % mod;
}
 
int cal(int i, int j){
    if(i < 0 || j < 0) return 0;
    if(dp[i][j] != -1) return dp[i][j];
    int ans = 0;
    ans = (ans + cal(i - 1, j)) % mod;
    ans = (ans + cal(i - 1, j - 2) * j % mod * (j - 1) % mod * dv % mod) % mod;
    ans = (ans + cal(i - 2, j - 1) * j % mod * (i - 1) % mod) % mod;
    ans = (ans + cal(i - 1, j - 1) * j % mod * 4 % mod) % mod;
 
    return dp[i][j] = ans;
}
 
signed main(){
    int n, m;
    cin >> n >> m;
    dv = bp(2, mod - 2);
    for(int i = 0; i <= n; i++) for(int j = 0; j <= m; j++) dp[i][j] = -1;
    for(int i = 0; i <= n; i++) dp[i][0] = 1;
    for(int i = 0; i <= m; i++) dp[0][i] = 1;
    cout << (cal(n, m) - 1 + mod)%mod;
    return 0;
}

Subtask #1
48.0 / 48.0

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

Subtask #2
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 960 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 2 ms 1728 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 3 ms 9820 KB Output is correct
15 Correct 143 ms 55388 KB Output is correct
16 Correct 3 ms 4188 KB Output is correct
17 Correct 17 ms 12876 KB Output is correct
18 Correct 35 ms 17244 KB Output is correct
19 Correct 159 ms 63308 KB Output is correct
20 Correct 125 ms 51244 KB Output is correct
21 Correct 73 ms 33852 KB Output is correct
22 Correct 84 ms 35672 KB Output is correct
23 Correct 56 ms 27484 KB Output is correct
24 Correct 221 ms 71244 KB Output is correct
25 Correct 146 ms 61528 KB Output is correct
26 Correct 172 ms 66896 KB Output is correct
27 Correct 200 ms 69460 KB Output is correct