제출 #1262638

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

tower

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 9;


int main() {
    ll n , d;
    cin >> n >> d;

    vector<ll> v(n);
    for(auto &x : v) {
        cin >> x;
    }
    ll ways = 1;
    sort(v.begin(), v.end());
    ll options = 0;
    ll ind = 0;
    for(int i = 0;i < n ;i++) {
        options++;
        while(v[i] - v[ind] > d) {
            ind++;
            options--;
        }
        ways *= options;
        ways %= MOD;
    }

    cout << ways << endl;
}

• 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