結果

問題 No.1510 Simple Integral
ユーザー tokusakuraitokusakurai
提出日時 2021-05-15 00:02:35
言語 C++17
(gcc 11.2.0 + boost 1.78.0)
結果
AC  
実行時間 269 ms / 2,000 ms
コード長 5,302 bytes
コンパイル時間 2,135 ms
使用メモリ 7,132 KB
最終ジャッジ日時 2022-11-26 00:28:13
合計ジャッジ時間 9,317 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 6 ms
7,028 KB
testcase_01 AC 6 ms
7,132 KB
testcase_02 AC 6 ms
7,028 KB
testcase_03 AC 6 ms
7,016 KB
testcase_04 AC 6 ms
6,944 KB
testcase_05 AC 6 ms
6,932 KB
testcase_06 AC 7 ms
7,048 KB
testcase_07 AC 7 ms
6,936 KB
testcase_08 AC 7 ms
7,016 KB
testcase_09 AC 7 ms
6,936 KB
testcase_10 AC 7 ms
6,940 KB
testcase_11 AC 7 ms
7,012 KB
testcase_12 AC 8 ms
6,944 KB
testcase_13 AC 114 ms
6,948 KB
testcase_14 AC 107 ms
7,064 KB
testcase_15 AC 149 ms
6,940 KB
testcase_16 AC 152 ms
7,028 KB
testcase_17 AC 118 ms
7,016 KB
testcase_18 AC 102 ms
6,964 KB
testcase_19 AC 120 ms
6,952 KB
testcase_20 AC 123 ms
6,940 KB
testcase_21 AC 141 ms
6,948 KB
testcase_22 AC 115 ms
6,936 KB
testcase_23 AC 256 ms
7,056 KB
testcase_24 AC 257 ms
6,932 KB
testcase_25 AC 260 ms
7,048 KB
testcase_26 AC 260 ms
6,956 KB
testcase_27 AC 258 ms
6,936 KB
testcase_28 AC 259 ms
7,052 KB
testcase_29 AC 269 ms
7,012 KB
testcase_30 AC 263 ms
6,944 KB
testcase_31 AC 257 ms
7,004 KB
testcase_32 AC 263 ms
7,004 KB
testcase_33 AC 175 ms
6,980 KB
testcase_34 AC 176 ms
7,024 KB
testcase_35 AC 178 ms
7,008 KB
testcase_36 AC 180 ms
7,008 KB
testcase_37 AC 161 ms
7,012 KB
testcase_38 AC 179 ms
7,060 KB
testcase_39 AC 176 ms
7,060 KB
testcase_40 AC 185 ms
7,052 KB
testcase_41 AC 185 ms
7,024 KB
testcase_42 AC 173 ms
7,044 KB
testcase_43 AC 7 ms
7,132 KB
testcase_44 AC 6 ms
6,940 KB
testcase_45 AC 13 ms
7,028 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#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>;
//const int MOD = 1000000007;
const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
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;};

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

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) {}

    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<998244353>;

template<int mod, int primitive_root>
struct Number_Theorem_Transform{
    using T = Mod_Int<mod>;
    vector<T> r, ir;

    Number_Theorem_Transform(){
        r.resize(30), ir.resize(30);
        for(int i = 0; i < 30; i++){
            r[i] = -T(primitive_root).pow((mod-1)>>(i+2));
            ir[i] = r[i].inverse();
        }
    }

    void ntt(vector<T> &a, int n) const{
        assert((n&(n-1)) == 0);
        a.resize(n);
        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)];
            }
        }
    }

    void intt(vector<T> &a, int n) const{
        assert((n&(n-1)) == 0);
        a.resize(n);
        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;
    }

    vector<T> convolve(vector<T> a, vector<T> b) const{
        int k = (int)a.size()+(int)b.size()-1, n = 1;
        while(n < k) n <<= 1;
        ntt(a, n), ntt(b, n);
        for(int i = 0; i < n; i++) a[i] *= b[i];
        intt(a, n), a.resize(k);
        return a;
    }
};

Number_Theorem_Transform<998244353, 3> NTT;

int main(){
    int N; cin >> N;

    vector<int> A(N);
    rep(i, N) cin >> A[i];

    int MAX = 1000000;
    vector<int> cnt(MAX+1, 0);
    rep(i, N) cnt[A[i]]++;

    rep(i, N) A.eb(-A[i]);

    mint r = 86583718; //虚数単位
    mint ans = 0;

    rep2(i, 1, MAX){
        if(cnt[i] == 0) continue;
        vector<mint> f(N+1, 0);
        f[0] = 1;
        
        each(e, A){
            if(e == i) continue;
            mint x = mint(e-i).inverse();
            x /= r;

            vector<mint> g(N+1);
            g[0] = -x;
            rep(i, N) g[i+1] = g[i]*x;

            f = NTT.convolve(f, g);
            f.resize(N+1);
        }

        ans += f[cnt[i]-1]*r*2;
    }

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