제출 #879563

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

tower

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

#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9 + 9;
const ll LOGN = 21;
const ll MAXN = 1e6 + 100;

vector<int> A;
int plc[MAXN];

int main() {
	fast
	int N, D;
	cin >> N >> D;

	A = vector<int>(N);
	for (int i = 0; i < N; i++)
		cin >> A[i];
	sort(A.begin(), A.end());

	for (int i = 0; i < N; i++)
		plc[i] = upper_bound(A.begin(), A.end(), A[i] + D) - A.begin();

	ll ans = 1;
	for (int i = 0; i < N; i++)
		ans = (ans * (plc[i] - i) % MOD);
	cout << ans << "\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