Submission #654309

#	Time	Username	Problem	Language	Result	Execution time	Memory
654309		megargayu	A Huge Tower (CEOI10_tower)	C++17	75 / 100	1 ms	212 KiB

tower

// https://oj.uz/problem/view/CEOI10_tower

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

#define ll long long
#define MOD ((ll)1e9 + 9)
#define MAX_N 1000

vector<int> a(MAX_N);

// TODO

int main()
{
  int N, D;
  cin >> N >> D;

  if (N > MAX_N)
    return N;

  for (int i = 0; i < N; ++i)
    cin >> a[i];

  sort(a.begin(), a.begin() + N);

  ll ans = 1;
  int j = 0;
  for (int i = 0; i < N; ++i)
  {
    while (j < N - 1 && a[j + 1] - a[i] <= D) ++j;
    ans = (ans * static_cast<ll>(j - i + 1)) % MOD;
  }

  cout << ans << '\n';

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