제출 #464309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464309		jackkkk	A Huge Tower (CEOI10_tower)	C++11	30 / 100	118 ms	8748 KiB

tower

/* 
Problem title: A Huge Tower
Problem link: https://oj.uz/problem/view/CEOI10_tower
*/

#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <array>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
#include <list>
#include <float.h>
#include <climits>
#include <cmath>

using namespace std;
#define _USE_MATH_DEFINES
#define F first
#define S second
#define MP make_pair

typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;

void quit(){
    cout.flush();
    exit(0);
}
LL NM=10e9+9;
int n, d;
vector <int> nums;
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  cin >> n >> d;
  nums.resize(n);
  for(int i = 0; i < n; i++){
    cin >> nums[i];
  }
  sort(nums.begin(), nums.end());
  int r = 1;
  long long ans = 1;

  for(int l = 0; l < n; l++){
    while(r<n && nums[r]-nums[l]<=d){
      ans *= r-l+1;
      ans %= NM;
      r++;
    }
  }
  cout << ans << "\n";
	quit();
}

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