제출 #1351314

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1351314		Minbaev	A Huge Tower (CEOI10_tower)	C++17	100 / 100	72 ms	10052 KiB

tower

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template <class T> using ste = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long

const ll inf = 1e9;
const ll mod = 1e9 + 9;

void solve(){
	
	int n, k;
	cin >> n >> k;
	
	vector<ll>dp(n + 1);
	int left = 0;
	
	vector<ll>v(n);
	for(auto &to : v)cin >> to;
	
	sort(v.begin(), v.end());
	
	dp[0] = 1;
	for(int i = 1;i<=n;i++){
		while(v[left] + k < v[i-1])left += 1;
		dp[i] = dp[i-1] * (0ll + i - left);
		dp[i] %= mod;
	}
	
	cout << dp[n] << "\n";
	
	
}

/*
6 9
10 20 20 10 10 20
*/
 signed main()
{
  //~ freopen("road.in", "r", stdin);
  //~ freopen("road.out", "w", stdout);
    ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
    int tt=1;//cin >> tt;
    while(tt--)solve();    
 
}

• 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