結果

問題 No.2952 Invision of Multiples
ユーザー woodywoodywoodywoody
提出日時 2024-10-27 02:38:39
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,567 bytes
コンパイル時間 4,820 ms
コンパイル使用メモリ 268,464 KB
実行使用メモリ 13,640 KB
最終ジャッジ日時 2024-10-27 02:38:57
合計ジャッジ時間 18,748 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
10,528 KB
testcase_01 AC 3 ms
6,816 KB
testcase_02 AC 300 ms
6,820 KB
testcase_03 AC 13 ms
6,816 KB
testcase_04 AC 14 ms
6,816 KB
testcase_05 AC 18 ms
6,820 KB
testcase_06 AC 18 ms
6,816 KB
testcase_07 AC 12 ms
6,820 KB
testcase_08 AC 13 ms
6,820 KB
testcase_09 AC 3,674 ms
6,816 KB
testcase_10 AC 3,830 ms
6,816 KB
testcase_11 TLE -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;
using std::cout;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outmv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/local_debug.h"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#define showsg(sg) {cout<<#sg<<" : "; rep(i,sg.get_size_for_localdebug()) {cout << sg.get(i) << " ";} cout << endl;}
#define showfw(fw) {cout<<#fw<<" : "; rep(i,fw.get_size_for_localdebug()) {cout << fw.sum(i,i+1) << " ";} cout << endl;}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#define showsg(sg)
#define showfw(fw)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

void solve(){
    int n,m; cin>>n>>m;
    const int c = 200;

    vi d(n);
    rep(i,n) cin>>d[i];

    vvm dp(c,vm(c));
    rep1(i,c) rep1(j,c){
        rep1(k,m+1){
            int x = i*k;
            if (x>m) break;
            dp[i][j] += (x-1)/j;
        }
    }
    mint ans = 0;

    mint cnt = 1;
    rep(i,n){
        cnt *= (m/d[i]);
    }

    vm rev(m+1);
    rep1(i,m+1) rev[i] = mint(1) / i;

    auto f = [&](bool isRev)->void{
        vm sum(m+1);
        rep(i,n){
            if (d[i]>=c){
                mint coef = mint(1) / (m/d[i]);
                coef *= cnt;
                rep1(j,m+1){
                    int x = d[i]*j;
                    if (x>m) break;
                    ans += sum[x] * coef;
                }
            }
            if (!isRev || d[i]<c){
                if (isRev){
                    int x = 0;
                    mint coef = mint(1) / (m/d[i]);
                    mint tmp = 0;
                    rep1(j,m+1){
                        sum[j] += tmp;
                        if (j%d[i]==0) tmp += coef;
                    }
                }else{
                    int x = 0;
                    mint coef = mint(1) / (m/d[i]);
                    mint tmp = 0;
                    rrepx(j,1,m+1){
                        sum[j] += tmp;
                        if (j%d[i]==0) tmp += coef;
                    }
                }
            }
        }
    };

    rep(i,n){
        if (d[i]>=c) continue;
        mint coef2 = cnt * rev[m/d[i]];
        repx(j,i+1,n){
            if (d[j]>=c) continue;
            ans += dp[d[i]][d[j]] * coef2 * rev[m/d[j]];
        }
    }

    f(false);
    reverse(rng(d));
    f(true);
    outm;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0