제출 #1014860

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1014860		coolbrother	A Huge Tower (CEOI10_tower)	C++17	100 / 100	199 ms	8852 KiB

tower

#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <set>
#include <queue>
#include <tuple>

using namespace std;

int main()
{
    int n, d;
    cin >> n >> d;

    vector<int> blocks(n);
    for (int i = 0; i < n; i++) {
        cin >> blocks[i];
    }
    sort(blocks.begin(), blocks.end());

    long long ans = 1;
    const int MOD = 1000000009;

    int j = 0;

    for (int i = 1; i < n; i++) {
        while (j < i && blocks[j] < blocks[i] - d) {
            j++;
        }
        ans *= i - j + 1;
        ans %= MOD;
    }

    cout << ans << 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