제출 #365053

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

tower

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

using ll = long long;

const int MOD = 1e9+7;

ll factorial(ll n){
  if(n==0) return 1;
  return n*factorial(n-1);
}

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);
  map<ll, ll> m; // value, number of values 
  ll l = 0, r = 0;
  for(; l<n; l++){
    if(arr[l]+d<arr[r]){
      l = r;
    }
    while(arr[l]+d>=arr[r] && r<n){
      m[l]=r-l+1;
      r++;
    }
  }
  ll ans = 1;
  for(auto u: m){
    ans*=factorial(u.second);
  }
  cout<<(ans%MOD);
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5