제출 #433501

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
433501		joshualiu555	A Huge Tower (CEOI10_tower)	C++14	55 / 100	31 ms	3564 KiB

tower

#include <fstream>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <climits>

using namespace std;

using ll = long long;
const int INF = 2e5 + 5;
const int MOD = 1e9 + 9;

ll n, d, x[INF];

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

    //ifstream fin(".in");
    //ofstream fout(".out");

    cin >> n >> d;
    for (ll i = 0; i < n; i++) cin >> x[i];
    sort(x, x + n);

    ll ans = 1;
    ll j = 0;
    for (ll i = 0; i < n; i++) {
        while (x[j + 1] - x[i] <= d && j < n - 1) j++;
        ll distance = j - i + 1;
        ans *= 1ll * distance % MOD;
    }

    cout << ans % MOD;

    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: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5