Submission #1159691

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159691		dosts	A Huge Tower (CEOI10_tower)	C++20	100 / 100	84 ms	10056 KiB

tower

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>

const int inf = 2e18,N = 1e5+1,MOD =  1e9+9;

int mult(int x,int y) {
    return (x*y)%MOD;
}

void solve() {
    int n,d;
    cin >> n >> d;
    vi a(n+1);
    for (int i=1;i<=n;i++) cin >> a[i];
    sort(a.begin()+1,a.end());
    vi r(n+1);
    int ptr = 1;
    for (int i=1;i<=n;i++) {
        while (ptr < n && a[ptr+1] <= a[i]+d) ptr++;
        r[i] = ptr;
    }
    int ans = 1;
    for (int i=1;i<=n;i++) {
        ans = mult(ans,r[i]-i+1);
    }
    cout << ans << '\n';
}



int32_t main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi 
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while (t --> 0) solve();
}

• 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