제출 #1258206

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

tower

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MOD = 1'000'000'009; // Proper constant declaration

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, d;
    cin >> n >> d;

    vector<ll> arr(n);
    for (auto &ref : arr) cin >> ref;

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

    ll ans = 1; // Start with first block
    for (int i = 1; i < n; i++) {
        ll curr_width = arr[i];

        // Find the first block with width >= curr_width - d
        ll start = lower_bound(arr.begin(), arr.begin() + i, curr_width - d) - arr.begin();

        ll k = i - start; // number of blocks the new block can be placed above
        ans = (ans + (ans * k) % MOD) % MOD;
    }

    cout << ans << '\n';
    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