제출 #1313973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313973		chithanhnguyen	A Huge Tower (CEOI10_tower)	C++20	100 / 100	105 ms	5176 KiB

tower

/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define fi first
#define se second
#define __builtin_popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) ((1ll << (x)))

#define debug(a, l, r) for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';

const int MOD = 1e9 + 9;

void solve() {
    int n, d; cin >> n >> d;
    vector<int> a(n + 5);

    for (int i = 1; i <= n; ++i) cin >> a[i];
    sort(begin(a) + 1, begin(a) + n + 1);

    int res = 1;
    for (int i = 1; i <= n; ++i) {
        int j = upper_bound(begin(a) + 1, begin(a) + n + 1, a[i] + d) - begin(a) - 1;
        res *= (j - i + 1);
        res %= MOD;
    }

    cout << res;
}

signed main() {
    #ifdef NCTHANH
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

    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