제출 #135475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
135475		imeimi2000	A Huge Tower (CEOI10_tower)	C++17	100 / 100	177 ms	3576 KiB

tower

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

using namespace std;
typedef long long llong;

const int mod = 1e9 + 9;
int n, d;
int A[1000000];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> d;
    for (int i = 0; i < n; ++i) {
        cin >> A[i];
    }
    sort(A, A + n);
    int ans = 1;
    for (int i = 0; i < n; ++i) {
        int x = lower_bound(A, A + n, A[i] - d) - A;
        ans = ans * (i + 1ll - x) % mod;
    }
    printf("%d\n", ans);
    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