oj.uz

Submission #1097557

# Submission time Handle Problem Language Result Execution time Memory
1097557 2024-10-07T14:55:19 Z TrinhKhanhDung Tents (JOI18_tents) C++14
100 / 100
 94 ms 47356 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 4e3 + 10;

int N, M;
int dp[MAX][MAX];

void solve(){
    cin >> N >> M;

    for(int i = 0; i <= N; i++) dp[i][0] = 1;
    for(int i = 0; i <= M; i++) dp[0][i] = 1;

    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= M; j++){
            add(dp[i][j], dp[i - 1][j]);
            add(dp[i][j], 4LL * j * dp[i - 1][j - 1] % MOD);
            if(j >= 2) add(dp[i][j], 1LL * dp[i - 1][j - 2] * (1LL * j * (j - 1) / 2 % MOD) % MOD);
            if(i >= 2) add(dp[i][j], 1LL * dp[i - 2][j - 1] * (i - 1) % MOD * j % MOD);
        }
    }

    int ans = dp[N][M];
    sub(ans, 1);

    cout << ans << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//     freopen("CAU3.inp","r",stdin);
//     freopen("CAU3.out","w",stdout);

    int t = 1;
//    cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 3 ms 9564 KB Output is correct
15 Correct 61 ms 33296 KB Output is correct
16 Correct 4 ms 2652 KB Output is correct
17 Correct 14 ms 7900 KB Output is correct
18 Correct 17 ms 10956 KB Output is correct
19 Correct 69 ms 37584 KB Output is correct
20 Correct 55 ms 30544 KB Output is correct
21 Correct 37 ms 20308 KB Output is correct
22 Correct 38 ms 22120 KB Output is correct
23 Correct 24 ms 19800 KB Output is correct
24 Correct 92 ms 47356 KB Output is correct
25 Correct 71 ms 36692 KB Output is correct
26 Correct 83 ms 41652 KB Output is correct
27 Correct 94 ms 45920 KB Output is correct