제출 #899700

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

tower

#include <bits/stdc++.h>

using namespace std;

#define MOD 1000000009
#define MAXN 5000010

long long n,d;
long long niz[MAXN];
long long val[MAXN];

int main()
{
    cin>>n>>d;
    for (long long i=1;i<=n;i++) cin>>niz[i];
    sort(niz+1,niz+n+1);
    for (long long i=1;i<=n;i++)
    {
        long long br=0;
        for (long long j=i-1;j>=1;j--)
        {
            if (niz[i]-niz[j]<=d) br++;
            else break;
        }
        val[i]=br;
    }
    long long ans=1;
    for (long long i=1;i<=n;i++)
    {
        ans*=(val[i]+1);
        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: 0 / 5
• Subtask 20: 0 / 5