제출 #499238

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499238		imaginary_unit	A Huge Tower (CEOI10_tower)	C++17	100 / 100	269 ms	8748 KiB

tower

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;

const int MOD=1e9+9;

int main()
{
    //freopen("truth.in", "r", stdin);
    //freopen("truth.out", "w", stdout);

    int n, d;
    cin >> n >> d;
    int a[n];
    for(int i=0; i<n; i++){
        cin >> a[i];
    }
    sort(a, a+n);
    int r=0, ans=1;
    for(int l=0; l<n; l++){
        while(r<n-1 && a[r+1]-a[l]<=d){
            r++;
        }
        int dist=r-l+1;
        ans=(ans*1LL*dist)%MOD;
    }
    cout << ans;
    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