Submission #1274397

#	Time	Username	Problem	Language	Result	Execution time	Memory
1274397		LeDaiKing	A Huge Tower (CEOI10_tower)	C++20	100 / 100	85 ms	2836 KiB

tower

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define ALL(n) n.begin(), n.end()
#define mask(n) (1ll << (n))
#define ck(n, k) (((n) >> (k))&1)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll MOD = (int)1e9 + 9;
int a[1000005];

void solution() {
    int n, d;
    cin >> n >> d;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + 1 + n);
    ll ans = 1;
    int l = 1, r = 1;
    for (int i = 1; i <= n; i++) {
        while(a[l] + d < a[i]) l++;
        while(r < i && a[r + 1] + d >= a[i]) r++;
        // cout << l << " " << r << endl;
        ll num = r - l + 1;
        ans = ans * num % MOD;
    }
    cout << ans;
}

int main()
{  
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int testcase = 1;
    // cin >> testcase;
    while (testcase--)
    {
        solution();
    }
    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