제출 #1277939

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

tower

#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define deb(x) cout<<#x<<'='<<x<<'\n';
#define deb2(x,y) cout<<#x<<'='<<x<<", "<<#y<<'='<<y<<'\n';
#define int long long
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
const long double PI = acos(-1);
const int mod = 1e9+9, inf = 1e18;
const int D = 1e6 + 10;

void solve_test() {
    int n, d; cin>>n>>d;
    int a[n];
    for (int i=0; i<n; i++)
        cin>>a[i];

    sort(a, a+n);

    int ans=1;
    for (int r=0, l=0; r<n; r++) {
        while (l<=r and a[l]+d<a[r])
            l++;
        ans *= (r-l+1);
        ans %= mod;
        // deb2(l, r);
    }
    cout << ans << '\n';
}

signed main() {
    fastio

    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) {
        // cout << "Case #" << i << ": ";
        solve_test();
    }
    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