제출 #459550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
459550		erke	A Huge Tower (CEOI10_tower)	C++11	85 / 100	1085 ms	7292 KiB

tower

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

#define int long long

const int N = 1000005;
const int MOD = 1e9 + 9;

int a[N], dp[N];

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, d;
  cin >> n >> d;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1, greater<int>());
  dp[0] = 1;
  for (int i = 1; i <= n; i++) {
    int j = i;
    while (j - 1 >= 1 && a[j - 1] <= a[i] + d) j--;
    dp[i] += (dp[i - 1] * (i - j + 1)) % MOD;
    dp[i] %= MOD;
  }
  cout << dp[n] << '\n';
}

• 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: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5