oj.uz

Submission #1093151

# Submission time Handle Problem Language Result Execution time Memory
1093151 2024-09-26T03:38:12 Z Whisper Tents (JOI18_tents) C++17
100 / 100
 247 ms 82896 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                 4444

int N, M;
int chooseTwo(int x){
    return x * (x - 1) / 2 % Mod;
}
void add(int &x, int y){
    x += y;
    if (x >= Mod) x %= Mod;
}
int mul(int a, int b){
    return 1LL * a * b % Mod;
}
int dp[MAX][MAX];
void process(void){
    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]);
            if(j >= 2) add(dp[i][j], mul(dp[i - 1][j - 2], chooseTwo(j)));
            if(i >= 2) add(dp[i][j], mul(mul(dp[i - 2][j - 1], i - 1), j));
            add(dp[i][j], dp[i - 1][j - 1] * j * 4 % Mod);
        }
    }
    cout << (dp[N][M] - 1 + Mod) % Mod;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 1376 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 864 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 3 ms 2396 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 1376 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 864 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 3 ms 2396 KB Output is correct
13 Correct 0 ms 352 KB Output is correct
14 Correct 4 ms 9824 KB Output is correct
15 Correct 167 ms 55324 KB Output is correct
16 Correct 11 ms 4192 KB Output is correct
17 Correct 37 ms 13000 KB Output is correct
18 Correct 46 ms 16980 KB Output is correct
19 Correct 180 ms 63064 KB Output is correct
20 Correct 150 ms 50900 KB Output is correct
21 Correct 96 ms 33800 KB Output is correct
22 Correct 93 ms 35416 KB Output is correct
23 Correct 55 ms 27224 KB Output is correct
24 Correct 244 ms 82896 KB Output is correct
25 Correct 185 ms 62904 KB Output is correct
26 Correct 212 ms 71604 KB Output is correct
27 Correct 247 ms 79808 KB Output is correct