結果

問題 No.1533 Don't be Negative!
ユーザー tokusakuraitokusakurai
提出日時 2023-07-14 21:17:34
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,322 ms / 8,000 ms
コード長 10,127 bytes
コンパイル時間 2,500 ms
コンパイル使用メモリ 214,484 KB
実行使用メモリ 122,580 KB
最終ジャッジ日時 2023-10-14 11:10:29
合計ジャッジ時間 46,405 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
17,240 KB
testcase_01 AC 127 ms
34,668 KB
testcase_02 AC 167 ms
42,564 KB
testcase_03 AC 221 ms
46,640 KB
testcase_04 AC 97 ms
27,036 KB
testcase_05 AC 126 ms
34,756 KB
testcase_06 AC 127 ms
34,672 KB
testcase_07 AC 97 ms
27,008 KB
testcase_08 AC 97 ms
27,012 KB
testcase_09 AC 167 ms
42,584 KB
testcase_10 AC 127 ms
34,728 KB
testcase_11 AC 544 ms
69,292 KB
testcase_12 AC 571 ms
65,964 KB
testcase_13 AC 300 ms
37,644 KB
testcase_14 AC 485 ms
53,932 KB
testcase_15 AC 596 ms
67,996 KB
testcase_16 AC 863 ms
90,176 KB
testcase_17 AC 280 ms
35,784 KB
testcase_18 AC 809 ms
85,896 KB
testcase_19 AC 345 ms
51,104 KB
testcase_20 AC 948 ms
96,696 KB
testcase_21 AC 428 ms
57,440 KB
testcase_22 AC 896 ms
92,496 KB
testcase_23 AC 898 ms
91,136 KB
testcase_24 AC 799 ms
84,444 KB
testcase_25 AC 695 ms
79,540 KB
testcase_26 AC 340 ms
54,716 KB
testcase_27 AC 774 ms
82,168 KB
testcase_28 AC 969 ms
98,356 KB
testcase_29 AC 832 ms
87,996 KB
testcase_30 AC 1,263 ms
118,380 KB
testcase_31 AC 206 ms
41,040 KB
testcase_32 AC 423 ms
57,380 KB
testcase_33 AC 991 ms
99,936 KB
testcase_34 AC 147 ms
31,108 KB
testcase_35 AC 942 ms
95,184 KB
testcase_36 AC 876 ms
91,824 KB
testcase_37 AC 398 ms
59,096 KB
testcase_38 AC 1,232 ms
116,572 KB
testcase_39 AC 1,084 ms
106,472 KB
testcase_40 AC 1,133 ms
110,696 KB
testcase_41 AC 1,004 ms
100,444 KB
testcase_42 AC 1,137 ms
110,240 KB
testcase_43 AC 1,109 ms
108,588 KB
testcase_44 AC 947 ms
96,204 KB
testcase_45 AC 1,054 ms
104,432 KB
testcase_46 AC 1,054 ms
104,500 KB
testcase_47 AC 1,138 ms
110,236 KB
testcase_48 AC 1,114 ms
108,656 KB
testcase_49 AC 1,134 ms
110,840 KB
testcase_50 AC 1,314 ms
122,568 KB
testcase_51 AC 1,251 ms
118,588 KB
testcase_52 AC 1,108 ms
108,300 KB
testcase_53 AC 1,320 ms
122,560 KB
testcase_54 AC 1,322 ms
122,580 KB
testcase_55 AC 1,322 ms
122,524 KB
testcase_56 AC 1,319 ms
122,508 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

template <int mod>
struct Mod_Int {
    int x;

    Mod_Int() : x(0) {}

    Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    static int get_mod() { return mod; }

    Mod_Int &operator+=(const Mod_Int &p) {
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator-=(const Mod_Int &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator*=(const Mod_Int &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    Mod_Int &operator/=(const Mod_Int &p) {
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator++() { return *this += Mod_Int(1); }

    Mod_Int operator++(int) {
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator--() { return *this -= Mod_Int(1); }

    Mod_Int operator--(int) {
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator-() const { return Mod_Int(-x); }

    Mod_Int operator+(const Mod_Int &p) const { return Mod_Int(*this) += p; }

    Mod_Int operator-(const Mod_Int &p) const { return Mod_Int(*this) -= p; }

    Mod_Int operator*(const Mod_Int &p) const { return Mod_Int(*this) *= p; }

    Mod_Int operator/(const Mod_Int &p) const { return Mod_Int(*this) /= p; }

    bool operator==(const Mod_Int &p) const { return x == p.x; }

    bool operator!=(const Mod_Int &p) const { return x != p.x; }

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod - 2);
    }

    Mod_Int pow(long long k) const {
        Mod_Int now = *this, ret = 1;
        for (; k > 0; k >>= 1, now *= now) {
            if (k & 1) ret *= now;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const Mod_Int &p) { return os << p.x; }

    friend istream &operator>>(istream &is, Mod_Int &p) {
        long long a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

template <typename T>
struct Number_Theoretic_Transform {
    static int max_base;
    static T root;
    static vector<T> r, ir;

    Number_Theoretic_Transform() {}

    static void init() {
        if (!r.empty()) return;
        int mod = T::get_mod();
        int tmp = mod - 1;
        root = 2;
        while (root.pow(tmp >> 1) == 1) root++;
        max_base = 0;
        while (tmp % 2 == 0) tmp >>= 1, max_base++;
        r.resize(max_base), ir.resize(max_base);
        for (int i = 0; i < max_base; i++) {
            r[i] = -root.pow((mod - 1) >> (i + 2)); // r[i]  := 1 の 2^(i+2) 乗根
            ir[i] = r[i].inverse();                 // ir[i] := 1/r[i]
        }
    }

    static void ntt(vector<T> &a) {
        init();
        int n = a.size();
        assert((n & (n - 1)) == 0);
        assert(n <= (1 << max_base));
        for (int k = n; k >>= 1;) {
            T w = 1;
            for (int s = 0, t = 0; s < n; s += 2 * k) {
                for (int i = s, j = s + k; i < s + k; i++, j++) {
                    T x = a[i], y = w * a[j];
                    a[i] = x + y, a[j] = x - y;
                }
                w *= r[__builtin_ctz(++t)];
            }
        }
    }

    static void intt(vector<T> &a) {
        init();
        int n = a.size();
        assert((n & (n - 1)) == 0);
        assert(n <= (1 << max_base));
        for (int k = 1; k < n; k <<= 1) {
            T w = 1;
            for (int s = 0, t = 0; s < n; s += 2 * k) {
                for (int i = s, j = s + k; i < s + k; i++, j++) {
                    T x = a[i], y = a[j];
                    a[i] = x + y, a[j] = w * (x - y);
                }
                w *= ir[__builtin_ctz(++t)];
            }
        }
        T inv = T(n).inverse();
        for (auto &e : a) e *= inv;
    }

    static vector<T> convolve(vector<T> a, vector<T> b) {
        if (a.empty() || b.empty()) return {};
        if (min(a.size(), b.size()) < 40) {
            int n = a.size(), m = b.size();
            vector<T> c(n + m - 1, 0);
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) c[i + j] += a[i] * b[j];
            }
            return c;
        }
        int k = (int)a.size() + (int)b.size() - 1, n = 1;
        while (n < k) n <<= 1;
        a.resize(n, 0), b.resize(n, 0);
        ntt(a), ntt(b);
        for (int i = 0; i < n; i++) a[i] *= b[i];
        intt(a), a.resize(k);
        return a;
    }
};

template <typename T>
int Number_Theoretic_Transform<T>::max_base = 0;

template <typename T>
T Number_Theoretic_Transform<T>::root = T();

template <typename T>
vector<T> Number_Theoretic_Transform<T>::r = vector<T>();

template <typename T>
vector<T> Number_Theoretic_Transform<T>::ir = vector<T>();

using NTT = Number_Theoretic_Transform<mint>;

vector<mint> convolve(vector<mint> a, vector<mint> b) {
    int n = sz(a), m = sz(b);
    vector<mint> c(n + m - 1, 0);
    rep(i, n) rep(j, m) c[i + j] += a[i] * b[j];
    return c;
}

void solve() {
    int N, M, K;
    cin >> N >> M >> K;

    vector<mint> f(2 * M + 1, 0);
    rep2(i, -M, M + 1) {
        if (abs(i) != K) f[M + i]++;
    }
    // print(f);

    int D = 1000;

    vector<vector<mint>> g(D + 1);
    g[0] = {1};
    rep(i, D) g[i + 1] = convolve(g[i], f);

    auto f_D = g[D];
    f_D.resize(1 << 19, 0);
    NTT::ntt(f_D);

    int L = ceil(N, D);
    vector<vector<mint>> h(L + 1, vector<mint>(1 << 19, 1));
    rep(i, L) rep(j, 1 << 19) h[i + 1][j] = h[i][j] * f_D[j];
    rep(i, L + 1) NTT::intt(h[i]);

    auto calc = [&](int i) {
        int j = i / D, k = i % D;
        mint ret = 0;
        rep(l, sz(g[k])) {
            if (M * i - l < 0) break;
            ret += g[k][l] * h[j][M * i - l];
        }
        return ret;
    };

    vector<mint> c(N + 1, 0);
    rep(i, N + 1) c[i] = calc(i);
    // print(c);

    mint ans = 0;
    mint tw = mint(2).inverse();
    rep2(i, 1, N + 1) {
        mint x = mint(2 * M + 1 - (K == 0 ? 1 : 2)).pow(i) - c[i];
        // cout << i MM mint(2 * M + 1 - (K == 0 ? 1 : 2)).pow(i) MM c[i] << '\n';
        x *= tw;
        x *= mint(2 * M + 1 - (K == 0 ? 1 : 2)).pow(N - i);
        // cout << i MM x << '\n';
        ans += x;
        ans += x * (N - i);
    }

    cout << ans << '\n';
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}
0