Submission #654306

#	Time	Username	Problem	Language	Result	Execution time	Memory
654306		megargayu	A Huge Tower (CEOI10_tower)	C++17	25 / 100	16 ms	848 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 70

vector<int> a(MAX_N);

// TODO

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

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

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

  // products of factorials of all valid "subproblems"

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

    if (j < N - 1 && a[j + 1] - a[i] <= D)
      ++j;
    else if (j < N - 1 && a[j + 1] - a[j] <= D)
    {
      i = j;
    }
    else i = ++j;
  }

  cout << ans << '\n';

  return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 5
• Subtask 4: 5 / 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