提出 #70800130

---

ソースコード 拡げる

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 998244353
#define mm(arr) memset(arr, 0, sizeof(arr))
#define F first
#define S second
#define int ll

const int N = 1e6 + 5;
int fact[N], inv[N];

int fastpow(int b, int p){
    if(p == 0){
        return 1;
    }
    if(p == 1){
        return b%MOD;
    }
    int ans = fastpow(b, p / 2);
    ans *= ans;
    ans %= MOD;
    if(p&1){
        ans *= b%MOD;
        ans %= MOD;
    }
    return ans;
}

int nck(int n, int k){
    if(k > n){
        return 0;
    }
    int ans = fact[n];
    ans *= inv[k];
    ans %= MOD;
    ans *= inv[n - k];
    ans %= MOD;
    return ans;
}

void init(){
    fact[0] = 1, inv[0] = 1;
    for(int i = 1; i < N; i++){
        fact[i] = (fact[i - 1] * i)%MOD;
        inv[i] = fastpow(fact[i], MOD - 2);
    }
}

int32_t main(){
    FAST
    int n, d; cin >> n >> d;
    init();
    vector<int> v(n);
    for(int i = 0; i < n; i++){
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    int ans = 1;
    for(int i = 0; i < n; i++){
        int freq = 0;
        int curr = i;
        while(curr < n && v[curr] == v[i]){
            curr++;
            freq++;
        }
        int ind = lower_bound(v.begin(), v.end(), v[i] - d) - v.begin();
        int can = max(0LL, i - ind) + 1;
        ans *= nck(can + freq - 1, freq);
        ans %= MOD;
        i = curr;
        i--;
    }
    cout << ans;
    return 0;
}

提出情報

ジャッジ結果