結果
問題 | No.1138 No Bingo! |
ユーザー | dyktr_06 |
提出日時 | 2024-08-16 20:06:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 14 ms / 3,000 ms |
コード長 | 9,745 bytes |
コンパイル時間 | 2,439 ms |
コンパイル使用メモリ | 205,732 KB |
実行使用メモリ | 9,472 KB |
最終ジャッジ日時 | 2024-08-16 20:06:48 |
合計ジャッジ時間 | 4,210 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 8 ms
6,940 KB |
testcase_04 | AC | 14 ms
9,472 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 8 ms
6,940 KB |
testcase_10 | AC | 12 ms
8,576 KB |
testcase_11 | AC | 13 ms
9,088 KB |
testcase_12 | AC | 5 ms
6,940 KB |
testcase_13 | AC | 3 ms
6,944 KB |
testcase_14 | AC | 13 ms
9,088 KB |
testcase_15 | AC | 7 ms
6,940 KB |
testcase_16 | AC | 13 ms
8,704 KB |
testcase_17 | AC | 12 ms
8,448 KB |
testcase_18 | AC | 12 ms
8,320 KB |
testcase_19 | AC | 9 ms
6,940 KB |
testcase_20 | AC | 13 ms
8,576 KB |
testcase_21 | AC | 11 ms
8,320 KB |
testcase_22 | AC | 11 ms
7,936 KB |
testcase_23 | AC | 2 ms
6,944 KB |
testcase_24 | AC | 8 ms
6,944 KB |
testcase_25 | AC | 5 ms
6,944 KB |
testcase_26 | AC | 5 ms
6,940 KB |
testcase_27 | AC | 8 ms
6,940 KB |
testcase_28 | AC | 6 ms
6,940 KB |
testcase_29 | AC | 5 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(n) for(int i = 0; i < (int)(n); ++i)#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)#define ALL(a) (a).begin(), (a).end()#define Sort(a) (sort((a).begin(), (a).end()))#define RSort(a) (sort((a).rbegin(), (a).rend()))#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))typedef long long int ll;typedef unsigned long long ul;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef vector<long double> vld;typedef pair<long long, long long> P;template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }const long long MINF = 0x7fffffffffff;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double EPS = 1e-9;const long double PI = acos(-1);template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; returnos; }template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";} return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr<< (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<*itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os<< pq.top() << " "; pq.pop(); } return os; }template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }template <long long Modulus>struct ModInt{long long val;constexpr ModInt(const long long _val = 0) noexcept : val(_val) {normalize();}void normalize(){val = (val % Modulus + Modulus) % Modulus;}inline ModInt &operator+=(const ModInt &rhs) noexcept {if(val += rhs.val, val >= Modulus) val -= Modulus;return *this;}inline ModInt &operator-=(const ModInt &rhs) noexcept {if(val -= rhs.val, val < 0) val += Modulus;return *this;}inline ModInt &operator*=(const ModInt &rhs) noexcept {val = val * rhs.val % Modulus;return *this;}inline ModInt &operator/=(const ModInt &rhs) noexcept {val = val * inv(rhs.val).val % Modulus;return *this;}inline ModInt &operator++() noexcept {if(++val >= Modulus) val -= Modulus;return *this;}inline ModInt operator++(int) noexcept {ModInt t = val;if(++val >= Modulus) val -= Modulus;return t;}inline ModInt &operator--() noexcept {if(--val < 0) val += Modulus;return *this;}inline ModInt operator--(int) noexcept {ModInt t = val;if(--val < 0) val += Modulus;return t;}inline ModInt operator-() const noexcept { return (Modulus - val) % Modulus; }inline ModInt inv(void) const { return inv(val); }ModInt pow(long long n){assert(0 <= n);ModInt x = *this, r = 1;while(n){if(n & 1) r *= x;x *= x;n >>= 1;}return r;}ModInt inv(const long long n) const {long long a = n, b = Modulus, u = 1, v = 0;while(b){long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= Modulus;if(u < 0) u += Modulus;return u;}friend inline ModInt operator+(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) += rhs; }friend inline ModInt operator-(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) -= rhs; }friend inline ModInt operator*(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) *= rhs; }friend inline ModInt operator/(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) /= rhs; }friend inline bool operator==(const ModInt &lhs, const ModInt &rhs) noexcept { return lhs.val == rhs.val; }friend inline bool operator!=(const ModInt &lhs, const ModInt &rhs) noexcept { return lhs.val != rhs.val; }friend inline istream &operator>>(istream &is, ModInt &x) noexcept {is >> x.val;x.normalize();return is;}friend inline ostream &operator<<(ostream &os, const ModInt &x) noexcept { return os << x.val; }};template <typename T>struct Combination{vector<T> memo, memoinv, inv;Combination(const int N) : memo(N + 1), memoinv(N + 1), inv(N + 1){T m = -1;long long mod = (m.val + 1LL);memo[0] = memo[1] = 1;memoinv[0] = memoinv[1] = 1;inv[1] = 1;for(int i = 2; i <= N; ++i){memo[i] = memo[i - 1] * i;inv[i] = mod - inv[mod % i] * (mod / i);memoinv[i] = memoinv[i - 1] * inv[i];}}inline T fact(const int n) const {return memo[n];}inline T factinv(const int n) const {return memoinv[n];}inline T ncr(const int n, const int r) const {if(n < r || r < 0) return 0;return (memo[n] * memoinv[r]) * memoinv[n - r];}inline T npr(const int n, const int r) const {if(n < r || r < 0) return 0;return memo[n] * memoinv[n - r];}// 重複組み合わせinline T nhr(const int n, const int r) const {if(n == 0 && r == 0) return 1;return ncr(n + r - 1, r);}// ボールの数、一個以上必要な箱の数、制限がない箱の数 (箱区別あり)// a = 0 の場合は重複組み合わせinline T choose(const int n, const int a, const int b = 0) const {if(n == 0) return !a;return ncr(n + b - 1, a + b - 1);}// +1 n 個, -1 m 個, 累積和 >= 0inline T cataran(const int n, const int m) const {return ncr(n + m, n) - ncr(n + m, n - 1);}// +1 n 個, -1 m 個, 累積和 > -kinline T cataran(const int n, const int m, const int k) const {if(m < k) return ncr(n + m, n);if(m < n + k) return ncr(n + m, n) - ncr(n + m, m - k);return 0;}// +1 n 個, -1 m 個, 累積和 < +kinline T cataran2(const int n, const int m, const int k) const {return cataran(m, n, k);}};void input(){}using mint = ModInt<MOD>;void solve(){ll n; in(n);Combination<mint> comb(n);mint ans = 0;// A = (p_i == i)// B = (p_i == n - i)// ANS = A + B - (A U B) = 2A - (A U B){// Arep(i, 2, n + 1){if(i % 2 == 0) ans += comb.factinv(i);else ans -= comb.factinv(i);}ans *= comb.fact(n);ans = comb.fact(n) - ans;ans *= 2;}{// B// OEIS A003471vector<mint> a(n + 4);a[0] = 1, a[1] = 0, a[2] = 0, a[3] = 0;rep(i, 4, n + 1){if(i % 2 == 0) a[i] = (i - 1) * a[i - 1] + 2 * (i - 2) * a[i - 4];else a[i] = (i - 1) * a[i - 1] + 2 * (i - 1) * a[i - 2];}ans -= comb.fact(n) - a[n];}out(ans);}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(20);input();solve();}