제출 #1339322

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

tower

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

const int MOD = 1000000009;

int main(int argc, char *argv[]) {
    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 dp = 1, i = 0, j = 1;
    while(j <= n - 1) {
        if(blocks[i] + d >= blocks[j]) {
            dp = (dp * (j - i + 1)) % MOD;
            j++;
        }
        else i++;
    }

    cout << dp << "\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