Submission #1262786

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262786		farbodchr	A Huge Tower (CEOI10_tower)	C++20	5 / 100	183 ms	9872 KiB

tower

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 9;

ll modpow(ll a, ll b, ll m = MOD) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

int main() {
    int n; 
    ll d;
    cin >> n >> d;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    sort(a.begin(), a.end());

    vector<ll> factoriel(n+1, 1);
    for (int i = 1; i <= n; i++) factoriel[i] = factoriel[i-1] * i % MOD;

    ll ans = 1, cnt = 1;
    for (int i = 1; i < n; i++) {
        if (a[i] > a[i-1] + d) {
            ans = ans * factoriel[cnt] % MOD;
            cnt = 1;
        } else {
            cnt++;
        }
    }
    ans *= factoriel[cnt] % MOD;

    cout << ans << "\n";
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 5 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5