Submission #668735

#	Time	Username	Problem	Language	Result	Execution time	Memory
668735		Dec0Dedd	A Huge Tower (CEOI10_tower)	C++14	100 / 100	311 ms	10520 KiB

tower

#include <bits/stdc++.h>

using namespace std;

#define ll long long

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

int main() {
    ll n, d; cin>>n>>d;
    vector<ll> a(n);
    for (int i=0; i<n; ++i) cin>>a[i];
    sort(a.begin(), a.end());

    ll ans=1, r=0;
    for (ll i=0; 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: 5 / 5
• Subtask 20: 5 / 5