제출 #600278

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

tower

#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
#include <string>
#include <cstdio>
#include <cstring>
#include <algorithm>  
#include <math.h>
#include <numeric>
using namespace std;
using ll=long long;
using ull=unsigned long long;

vector<int> a={-1};
int N, D, w;
ll E=1000000009;

ll f(int i){
  if (i==1) return 1;
  int u=lower_bound(a.begin()+1, a.begin()+i, a[i]-D)-a.begin();
  int b=i-u;
  return ((ll)(1+b)*(ll)(f(i-1)))%E;
}

int main() {
  // ifstream cin("file.in");
  cin>>N>>D;
  for (int i=1; i<=N; i++){
    cin>>w;
    a.push_back(w);
  }
  sort(a.begin(), a.end());
  cout<<f(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: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5