Submission #762710

#	Time	Username	Problem	Language	Result	Execution time	Memory
762710		lalig777	A Huge Tower (CEOI10_tower)	C++14	100 / 100	222 ms	7604 KiB

tower

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;

int main (){
    int n, d;
    cin>>n>>d;
    vector<int>v(n);
    for (int i=0; i<n; i++) cin>>v[i];
    sort(v.begin(), v.end());
    vector<int>dp(n);
    vector<int>b(n);
    for (int i=1; i<n; i++){
        b[i]=b[i-1]+1;
        for (int j=i-b[i]; j<i; j++){
            if (v[i]>v[j]+d) b[i]--;
            else break;
        }
    }dp[0]=1;
    int mod = 1e9+9;
    for (int i=1; i<n; i++) dp[i]=(dp[i-1]*1ll*(b[i]+1))%mod;
    cout<<dp[n-1]<<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