Submission #1355000

#	Time	Username	Problem	Language	Result	Execution time	Memory
1355000		iamhereforfun	A Huge Tower (CEOI10_tower)	C++20	100 / 100	71 ms	2708 KiB

tower

// Starcraft 2 enjoyer //

#include <bits/stdc++.h>

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define LSOne(X) ((X) & -(X))

const int N = 1e6 + 5;
const int M = 2e6 + 5;
const long long K = (1LL << 60) - 1;
const int LG = 20;
const long long INF = 1e18 + 5;
const int C = 26;
const int B = 1000;
const int MOD = 1e9 + 9;

int n, d, a[N], l;
long long ans;

inline void solve()
{
    cin >> n >> d;
    ans = 1;
    for (int x = 0; x < n; x++)
    {
        cin >> a[x];
    }
    sort(a, a + n);
    l = 0;
    for (int x = 1; x < n; x++)
    {
        while (l < x)
        {
            if (a[l] + d < a[x])
                l++;
            else
                break;
        }
        ans *= x - l + 1;
        ans %= MOD;
    }
    l = 0;
    cout << ans << "\n";
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    for (int x = 1; x <= t; x++)
    {
        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