Submission #1325873

#	Time	Username	Problem	Language	Result	Execution time	Memory
1325873		matrix27	A Huge Tower (CEOI10_tower)	C++20	100 / 100	238 ms	2824 KiB

tower

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

int main() {
    int N, D;
    cin >> N >> D;
    vector<int> lengths(N);
    for (int i = 0; i < N; i++) cin >> lengths[i];
    sort(lengths.begin(), lengths.end());
    ll combinations = 1;
    for (int i = N - 1; i >= 0; i--) {
        int count = upper_bound(lengths.begin(), lengths.end(), lengths[i] + D) - lengths.begin() - i;
        combinations *= count;
        combinations %= 1000000009;
    }
    cout << combinations << '\n';
    return 0;
}

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