Submission #1010184

#	Time	Username	Problem	Language	Result	Execution time	Memory
1010184		Petrix	A Huge Tower (CEOI10_tower)	C++17	35 / 100	180 ms	12636 KiB

tower

#include <iostream>
#include <algorithm>
using namespace std;

#define MOD 1000000009

long long v[10000001];

int main()
{
    int n,m,i,rasp,st;
    cin>>n>>m;
    for(i=1;i<=n;i++) cin>>v[i];
    sort(v+1,v+n+1);
    rasp=1;st=1;
    for(i=1;i<=n;i++){
        while(st<i && v[st]+m<v[i])
            st++;
        rasp=(rasp*(i-st+1))%MOD;
    }
    cout<<rasp;
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 5 / 5
• Subtask 9: 0 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5