Submission #932900

#	Time	Username	Problem	Language	Result	Execution time	Memory
932900		Kavelmydex	A Huge Tower (CEOI10_tower)	C++17	100 / 100	119 ms	10532 KiB

tower

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define pb push_back
// #define f first
#define s second
#define endl "\n"
#define sp ' '
#define sz size()
#define all(x) (x).begin(),(x).end()

const int N = 100, OO = 1e18, mod = 1e9+9, mx = 1e6+10;
void tr(int a, int b){cout << a << sp << b << endl;}
void cmx(int &a, int b){a = max(a,b);}
void cmn(int &a, int b){a = min(a,b);}

int n,k; 
int a[N], vis[N], ans;
int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> k;
    vi a(n);
    for(int &i: a) cin >> i;
    sort(a.rbegin(), a.rend());
    ans = 1;
    for(int i=1; i<n; ++i){ 
        int l = -1, r = i;
        while(r > l+1){
            int m = (l+r)/2;
            if(a[m]-a[i] <= k) r = m;
            else l = m;
        }
        ans *= (i-l); ans %= mod;      
    }
    cout << ans << endl;
    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