제출 #462239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
462239		AlexLuchianov	A Huge Tower (CEOI10_tower)	C++14	100 / 100	141 ms	9860 KiB

tower

#include <iostream>
#include <vector>
#include <algorithm>

using ll = long long;

int const modulo = 1000000009;

int main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);

  int n, d;
  std::cin >> n >> d;
  std::vector<int> v;
  for(int i = 1; i <= n; i++) {
    int aux;
    std::cin >> aux;
    v.push_back(aux);
  }
  std::sort(v.begin(), v.end());
  int ptr = v.size() - 1;
  int result = 1;
  for(int i = v.size() - 2; 0 <= i; i--) {
    while(v[i] + d < v[ptr])
      ptr--;
    result = 1LL * result * (ptr - i + 1) % modulo;
  }
  std::cout << result;
  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