Submission #652697

#	Time	Username	Problem	Language	Result	Execution time	Memory
652697		kavnwang	A Huge Tower (CEOI10_tower)	C++14	100 / 100	266 ms	10496 KiB

tower

#include <bits/stdc++.h>

using namespace std;
const int MOD = 1e9 + 9;


int main() {
    int n, d;
    cin >> n >> d;
    int arr[n];
    for(int i = 0;i<n;i++) {
        cin >> arr[i];
    }
    sort(arr,arr+n);

    int count[n];

    long long int ans = 1;

    int left = 0;
    int right = 0;

    while(left <= right) {
        while(right < n && arr[right] - arr[left] <=d) {
                count[right] = right - left+1;
                right++;
        }
        left++;
    }

    for(int i =0;i<n;i++) {
        ans = (ans * 1LL * count[i]) % MOD;
    }

    cout << ans << 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