제출 #1210961

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

tower

#include <bits/stdc++.h>

using namespace std;

#define ll long long
const ll mod = 1e9 + 9; 
const ll mmod = 998244353;  
#define vl vector<long long>
#define vll vector<vector<long long>>

ll pow(ll x, ll n, ll mod){
    if (n == 0){
        return 1;
    }
ll half = pow(x, n / 2, mod);
ll half_square = (half * half) % mod;

if (n % 2 == 0) {
    return half_square;
} else {
    return (half_square * x) % mod;
}
}   


ll inversion_x(ll x, ll m){
    ll vysledek = pow(x,m-2);
    return vysledek;
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, d;
        
    cin >> n >> d;

    vl cisla;
    for (ll i = 0; i < n; i++){
        ll cislo;
        cin >> cislo;
        cisla.push_back(cislo);

    }

    sort (cisla.begin(), cisla.end());
    ll l = 0, r = 0;
    ll result = 1;
    while (r < n){
        while (cisla[r] - cisla[l] > d){
            l++;
        }
        //l -= 1;
        result *= (-l + r + 1);
        result %= mod;
        r++; 


    }
    cout << result%mod << 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