제출 #336771

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

tower

#include <iostream>
#include <bits/stdc++.h> 
#include <array>
#include <fstream>
#include <string>
#include <algorithm>
#include <cmath>
#include <sstream>
using namespace std;
using ll=long long;

int main() {
  int N;
  ll D, w;
  // ifstream cin("file.in");
  cin>>N>>D;
  vector<ll> a;
  for (int i=0; i<N; i++) cin>>w, a.push_back(w);
  sort(a.begin(), a.end(), greater<ll>());
  ll c[N+1];
  auto it1=a.begin();
  for (int x=N; x>=2; x--){
    auto it=upper_bound(a.begin(), a.end(), a[N-x]-D, greater<ll>());
    c[x]=it-it1;
    it1++;
    // cout<<it-a.begin()<<" "<<it1-a.begin()<<"\n";
    // cout<<c[x];
  }
  ll T=1, z=1000000009;
  for (int i=2; i<=N; i++) T= (T*c[i])%z;
  cout<<T;
}

• 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