제출 #668733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668733		Dec0Dedd	A Huge Tower (CEOI10_tower)	C++14	90 / 100	47 ms	3100 KiB

tower

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int N = 1e5+10;
const ll MOD = 1e9+9;

ll a[N], n, d;

int main() {
    cin>>n>>d;
    for (int i=1; i<=n; ++i) cin>>a[i];
    sort(a+1, a+n+1);

    ll ans=1, r=1;
    for (ll i=1; i<=n; ++i) {
        r=max(i, r);
        while (r <= n && a[i]+d >= a[r]) ++r;
        (ans*=r-i)%=MOD;
    } cout<<ans<<"\n";
}

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