Submission #868312

#	Time	Username	Problem	Language	Result	Execution time	Memory
868312		overwatch9	A Huge Tower (CEOI10_tower)	C++17	15 / 100	202 ms	19628 KiB

tower

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const int mod = 1e9 + 9;
vector <ll> dp, nums, perm;
int n, d;
ll solve(int i) {
    if (i <= 0)
        return 1;
    if (dp[i] != -1)
        return dp[i];
    int l = lower_bound(nums.begin() + 1, nums.end(), nums[i] - d) - nums.begin();
    int r = upper_bound(nums.begin() + 1, nums.end(), nums[i] + d) - nums.begin();
    r--;
    ll ans = solve(l-1) * perm[r - l + 1];
    ans %= mod;
    dp[i] = ans;
    return ans;
}
int main() {
    cin >> n >> d;
    dp.resize(n+1, -1);
    nums.resize(n+1);
    perm.resize(n+1);
    perm[1] = 1;
    for (int i = 2; i <= n; i++)
        perm[i] = (perm[i-1] * i) % mod;
    for (int i = 1; i <= n; i++)
        cin >> nums[i];
    sort(nums.begin(), nums.end());
    cout << solve(n) << '\n';
}

• Subtask 1: 0 / 5
• Subtask 2: 5 / 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: 5 / 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