제출 #1241135

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241135		papaulo	A Huge Tower (CEOI10_tower)	C++20	100 / 100	94 ms	5192 KiB

tower

#include <bits/stdc++.h>
using namespace std;

#define MAXN 10001000

typedef long long ll;
ll arr[MAXN];

const ll MOD = 1e9L+9LL;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n, d;
    cin >> n >> d;
    for(ll i=0;i<n;i++) cin >> arr[i];
    sort(arr, arr+n);
    ll ans=1;
    for(ll i=0;i<n;i++) {
        ll j=lower_bound(arr, arr+n, arr[i]-d)-arr;
        ans*=(i-j+1);
        ans%=MOD;
    }
    cout << ans << endl;
    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