Submission #1132072

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132072		Octa_pe_info	A Huge Tower (CEOI10_tower)	C++20	100 / 100	182 ms	2840 KiB

tower

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

const int MOD = 1e9 + 9;

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

    sort(a.begin(), a.end());

    int dr = 0;
    int rez = 1;

    for (int st = 0; st < n; st++) {

        while (dr < n - 1 && a[dr + 1] - a[st] <= d) {
            dr++;
        }

        int l = dr - st + 1;
        rez = (rez * 1LL * l) % MOD;
    }

    cout << rez << 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: 5 / 5
• Subtask 20: 5 / 5