Submission #868156

#	Time	Username	Problem	Language	Result	Execution time	Memory
868156		overwatch9	A Huge Tower (CEOI10_tower)	C++17	20 / 100	1066 ms	54908 KiB

tower

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

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