Submission #954445

#	Time	Username	Problem	Language	Result	Execution time	Memory
954445		thiago_bastos	A Huge Tower (CEOI10_tower)	C++17	100 / 100	97 ms	9004 KiB

tower

#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9 + 9;

void solve() {
    int n, d;

    cin >> n >> d;

    vector<int> a(n);
    int answer = 1, lo = 0;

    for(int& v : a) cin >> v;

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

    for(int i = 0; i < n; ++i) {
        while(a[lo] < a[i] - d) ++lo;
        answer = (i - lo + 1ll) * answer % MOD;
    }

    cout << answer << '\n';
}

int main() {
    int t = 1;
    ios_base :: sync_with_stdio(false);
    cin.tie(0);
    //cin >> t;
    while(t--) solve();
    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