제출 #886517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
886517		stefanneagu	A Huge Tower (CEOI10_tower)	C++17	30 / 100	210 ms	4516 KiB

tower

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

const int nmax = 1e6 + 1, mod = 1e9 + 9;

int v[nmax], n, h;
long long ans;
bool f[nmax];

void dfs(int x, int cnt) {
  if(cnt == n) {
    ans ++;
  }
  for(int i = 1; i <= n; i ++) {
    if(!f[i] && v[x] + h >= v[i]) {
      f[i] = 1;
      dfs(i, cnt + 1);
      f[i] = 0;
    }
  }
}

int main() {
  cin >> n >> h;
  for(int i = 1; i <= n; i ++) {
    cin >> v[i];
  }
  sort(v + 1, v + n + 1, greater<int>());
  if(n > 14) {
    int curr = 1;
    ans = 1;
    for(int i = 1; i <= n; i ++) {
      if(v[curr] > v[i] + h) {
          curr ++;
      }
      ans = ans * (i - curr + 1);
      ans %= mod;
    }
    cout << ans;
    return 0;
  }

  for(int i = 1; i <= n; i ++) {
    f[i] = 1;
    dfs(i, 1);
    f[i] = 0;
  }
  cout << ans;
  return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 5 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 5 / 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