結果
問題 |
No.3123 Inversion
|
ユーザー |
|
提出日時 | 2025-04-10 01:50:41 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 936 ms / 10,000 ms |
コード長 | 2,358 bytes |
コンパイル時間 | 4,556 ms |
コンパイル使用メモリ | 276,204 KB |
実行使用メモリ | 198,568 KB |
最終ジャッジ日時 | 2025-04-18 00:22:30 |
合計ジャッジ時間 | 32,401 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using vi = vector<int>; using vl = vector<ll>; #define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep2(i, a, b) rep3(i, a, b, 1) #define rep1(i, n) rep2(i, 0, n) #define rep0(n) rep1(aaaaa, n) #define ov4(a, b, c, d, name, ...) name #define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__) #define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--) #define fore(e, v) for (auto&& e : v) #define all(a) begin(a), end(a) #define sz(a) (int)(size(a)) #define lb(v, x) (lower_bound(all(v), x) - begin(v)) #define eb emplace_back template <typename T, typename S> bool chmin(T& a, const S& b) { return a > b ? a = b, 1 : 0; } template <typename T, typename S> bool chmax(T& a, const S& b) { return a < b ? a = b, 1 : 0; } const int INF = 1e9 + 100; const ll INFL = 3e18 + 100; #define i128 __int128_t struct _ { _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); } } __; const int MAX_N = 5'000'000 + 100; int MOD; void ch(ll& a, ll b) { a = (a + b) % MOD; } int main() { int T; cin >> T >> MOD; vl rot4(MAX_N), rot2_sym(MAX_N), rot2(MAX_N), sym(MAX_N), Fact(MAX_N); rot4[4] = 2; rep(i, 8, MAX_N, 4) { rot4[i] = rot4[i - 4] * (i - 2) % MOD; } rep(i, 5, MAX_N, 4) { rot4[i] = rot4[i - 1]; } rot2_sym[2] = 2; rot2_sym[4] = 6; rep(i, 6, MAX_N, 2) { rot2_sym[i] = (2 * rot2_sym[i - 2] + (i - 2) * rot2_sym[i - 4]) % MOD; } rep(i, 3, MAX_N, 2) { rot2_sym[i] = rot2_sym[i - 1]; } rot2[2] = 2; rep(i, 4, MAX_N, 2) { rot2[i] = i * rot2[i - 2] % MOD; } rep(i, 3, MAX_N, 2) { rot2[i] = rot2[i - 1]; } sym[1] = 1; sym[2] = 2; rep(i, 3, MAX_N) { sym[i] = (sym[i - 1] + (i - 1) * sym[i - 2]) % MOD; } Fact[0] = 1; rep(i, 1, MAX_N) { Fact[i] = Fact[i - 1] * i % MOD; } while (T--) { int N; cin >> N; if (N == 1) { cout << 1 % MOD << '\n'; continue; } ll c2 = rot4[N], c3 = rot2_sym[N], c4 = (rot2[N] - rot2_sym[N] - rot4[N]) % MOD, c5 = (sym[N] - rot2_sym[N]) % MOD, c6 = c5, c7 = (Fact[N] - c2 - c3 - c4 - c5 - c6) % MOD; ll ans = 0; ch(ans, c2 * 2); ch(ans, c3 * 2); ch(ans, c4 * 4); ch(ans, c5 * 4); ch(ans, c6 * 4); ch(ans, c7 * 8); ch(ans, MOD); cout << ans << '\n'; } }