oj.uz

답안 #975545

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975545 2024-05-05T12:59:18 Z green_gold_dog Festivals in JOI Kingdom 2 (JOI23_festival2) C++17
51 / 100
 4517 ms 1048576 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, mod;
        cin >> n >> mod;
        ll all = 1;
        for (ll i = 1; i <= n; i++) {
                all *= (i * 2 - 1);
                all %= mod;
        }
        vector<vector<ll>> dp1(n * 2 + 1, vector<ll>(n * 2 + 1, 0)), dp2(n * 2 + 1, vector<ll>(n * 2 + 1, 0));
        vector<ll> died(n + 1, 0);
        dp1[0][0] = 1;
        for (ll i = 0; i < n; i++) {
                vector<vector<ll>> ndp1(n * 2 + 1, vector<ll>(n * 2 + 1, 0)), ndp2(n * 2 + 1, vector<ll>(n * 2 + 1, 0));
                ll nc = 2 * n - i * 2;
                for (ll c1 = 0; c1 <= nc; c1++) {
                        for (ll c2 = 0; c2 <= nc - c1; c2++) {
                                dp1[c1][c2] %= mod;
                                dp2[c1][c2] %= mod;
                                ll c3 = nc - c1 - c2;
                                {//from dp1
                                        if (c1 > 0) {
                                                for (ll j = 0; j < c1 - 1; j++) {
                                                        ndp1[j][c2 + (c1 - j - 2)] += dp1[c1][c2];
                                                }
                                                if (c2 > 0) {
                                                        ndp1[c1 - 1][c2 - 1] += dp1[c1][c2] * c2;
                                                }
                                                ndp1[c1 - 1][c2] += dp1[c1][c2] * c3;
                                        } else {
                                                if (c2 > 0) {
                                                        for (ll j = 0; j < c3; j++) {
                                                                ndp2[c2 - 1][j] += dp1[c1][c2];
                                                        }
                                                } else {
                                                        for (ll j = 0; j < c3 - 1; j++) {
                                                                ndp1[j][0] += dp1[c1][c2];
                                                        }
                                                }
                                        }
                                }
                                {//from dp2
                                        if (c1 > 0) {
                                                for (ll j = 0; j < c2; j++) {
                                                        ndp2[c1 - 1][j] += dp2[c1][c2];
                                                }
                                                ndp2[c1 - 1][c2] += dp2[c1][c2] * c3;
                                        } else {
                                                if (c2 > 0) {
                                                        for (ll j = 0; j < c2 - 1; j++) {
                                                                ndp1[j][0] += dp2[c1][c2];
                                                        }
                                                        for (ll j = 0; j < c3; j++) {
                                                                ndp1[c2 - 1][j] += dp2[c1][c2];
                                                        }
                                                }
                                        }
                                }
                        }
                }
                swap(dp1, ndp1);
                swap(dp2, ndp2);
        }
        cout << (all - dp1[0][0] % mod + mod) % mod << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

festival2.cpp: In function 'int main()':
festival2.cpp:117:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
festival2.cpp:118:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 472 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 4517 ms 12244 KB Output is correct
20 Correct 4158 ms 11944 KB Output is correct
21 Correct 4099 ms 12244 KB Output is correct
22 Correct 4 ms 604 KB Output is correct
23 Correct 60 ms 1760 KB Output is correct

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 4517 ms 12244 KB Output is correct
20 Correct 4158 ms 11944 KB Output is correct
21 Correct 4099 ms 12244 KB Output is correct
22 Correct 4 ms 604 KB Output is correct
23 Correct 60 ms 1760 KB Output is correct
24 Runtime error 668 ms 1048576 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 4517 ms 12244 KB Output is correct
20 Correct 4158 ms 11944 KB Output is correct
21 Correct 4099 ms 12244 KB Output is correct
22 Correct 4 ms 604 KB Output is correct
23 Correct 60 ms 1760 KB Output is correct
24 Runtime error 668 ms 1048576 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -