Submission #1011056

#	Time	Username	Problem	Language	Result	Execution time	Memory
1011056		Rishabh_Gala	A Huge Tower (CEOI10_tower)	C++17	100 / 100	196 ms	17580 KiB

tower

#include<vector>
#include<iostream>
#include<queue>
#include<algorithm>
#include<fstream>
using namespace std;
int main(){
    long long mo = 1000000009;
    long long n, d;
    cin >> n >> d;
    vector<long long> lst;
    for (long long i = 0; i < n; i++){
        long long temp;
        cin >> temp;
        lst.push_back(temp);
    }
    sort(lst.begin(), lst.end());
    vector<long long> left(n, 0);
    long long r = n-1;
    long long l = n-1;
    while (r >= 0 && l >= 0){
        if (lst[l] + d >= lst[r]){
            left[r] = l;
            l--;
        } else {
            r--;
            if (r >= 0){
                left[r] = l+1;
            }
        }
    }
    long long ans = 1;
    for (long long i = 0; i < n; i++){
        ans = ans*(i - left[i] + 1) % mo;
    }
    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