제출 #365065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
365065		horsefeedapples	A Huge Tower (CEOI10_tower)	C++11	100 / 100	322 ms	10732 KiB

tower

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int MOD = 1e9+9;

int main() {
  ll n, d;
  cin>>n>>d;
  ll arr[n];
  for(ll i=0; i<n; i++){
    cin>>arr[i];
  }
  sort(arr, arr+n);
  ll l = 0, r = 0;
  ll sol = 1;
  for(; l<n; l++){
    while(arr[l]+d>=arr[r+1] && r<n-1){
      r++;
    }
    ll dist = r-l+1;
    sol = (sol*dist)%MOD;
  }
  cout<<(sol%MOD);
}

• 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