oj.uz

Submission #855904

# Submission time Handle Problem Language Result Execution time Memory
855904 2023-10-02T08:50:29 Z wakandaaa Zapina (COCI20_zapina) C++17
110 / 110
 304 ms 6228 KB 
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1 << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
    return l + rd() % (r - l + 1);
}

const int N = 750 + 5;
const int mod = 1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int inf = 1e9; // INT_MAX;
const long long llinf = 1e18; // LLONG_MAX;

template<class X, class Y>
bool minimize(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}

template<class X, class Y>
bool maximize(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}

template<class X, class Y>
bool add(X &a, Y b) {
    a += b;
    while (a >= mod) a -= mod;
    while (a < 0) a += mod;
    return true;
}

int MUL(int x, int y) {
    return 1LL * x * y % mod;
}

int n;
int c[N][N], f[N][N], g[N][N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    c[0][0] = 1;

    for (int i = 1; i <= 750; ++i)
        for (int j = 0; j <= i; ++j) {
            if (j == 0 || j == i) c[j][i] = 1;
            else {
                add(c[j][i], c[j - 1][i - 1]);
                add(c[j][i], c[j][i - 1]);
            }
        }

    cin >> n;

    f[0][0] = g[0][0] = 1;

    for (int i = 1; i <= n; ++i)
        for (int j = 0; j <= n; ++j)
            for (int k = 0; j - k >= 0; ++k) {
                add(f[i][j], MUL(f[i - 1][j - k], c[k][j]));
            }

    for (int i = 1; i <= n; ++i)
        for (int j = 0; j <= n; ++j)
            for (int k = 0; j - k >= 0; ++k) {
                if (k != i) add(g[i][j], MUL(g[i - 1][j - k], c[k][j]));
            }

    int res = f[n][n];
    add(res, -g[n][n]);

    cout << res;

    return 0;
}

/*

*/

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4788 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4788 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 3 ms 4952 KB Output is correct
9 Correct 2 ms 4816 KB Output is correct
10 Correct 3 ms 4832 KB Output is correct
11 Correct 2 ms 4968 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 3 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 3 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct

Subtask #3
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4788 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 3 ms 4952 KB Output is correct
9 Correct 2 ms 4816 KB Output is correct
10 Correct 3 ms 4832 KB Output is correct
11 Correct 2 ms 4968 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 3 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 3 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 140 ms 5716 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 36 ms 5436 KB Output is correct
20 Correct 3 ms 4952 KB Output is correct
21 Correct 186 ms 6108 KB Output is correct
22 Correct 24 ms 5468 KB Output is correct
23 Correct 4 ms 5212 KB Output is correct
24 Correct 43 ms 5444 KB Output is correct
25 Correct 30 ms 5468 KB Output is correct
26 Correct 57 ms 5420 KB Output is correct
27 Correct 277 ms 6080 KB Output is correct
28 Correct 281 ms 6080 KB Output is correct
29 Correct 275 ms 5972 KB Output is correct
30 Correct 280 ms 5960 KB Output is correct
31 Correct 283 ms 6228 KB Output is correct
32 Correct 279 ms 5972 KB Output is correct
33 Correct 279 ms 5972 KB Output is correct
34 Correct 297 ms 6072 KB Output is correct
35 Correct 286 ms 5856 KB Output is correct
36 Correct 304 ms 6104 KB Output is correct
37 Correct 297 ms 6068 KB Output is correct