제출 #899728

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
899728		ivaziva	A Huge Tower (CEOI10_tower)	C++14	100 / 100	97 ms	10092 KiB

tower

#include <bits/stdc++.h>

using namespace std;

#define MOD 1000000009
#define MAXN 100010

long long n,d;
vector<long long> niz;

int main()
{
    ios_base::sync_with_stdio(false);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>d;
    for (long long i=1;i<=n;i++)
    {
        long long x; cin>>x;
        niz.push_back(x);
    }
    sort(niz.begin(),niz.end());
    long long ans=1;
    long long j=0;
    for (long long i=0;i<n;i++)
    {
        while (j<n-1 and niz[j+1]-niz[i]<=d) j++;
        long long br=j-i+1;
        ans*=br; if (ans>=MOD) ans%=MOD;
    }
    cout<<ans<<endl;
}

• 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