제출 #135921

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

tower

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

typedef long long lint;

const int MOD = 1e9 + 9;
const int MAXN = 1e6 + 5;

int A[MAXN];

int main() {
	int N, D;
	lint ans = 1;

	cin >> N >> D;
	for(int i = 0; i < N; i++) cin >> A[i];

	sort(A, A + N);
	int p = 0;
	for(int i = 0; i < N; i++) {
		while(A[p] < A[i] - D) p++;
		ans = ans * (i - p + 1) % MOD;
	}

	cout << ans;
	return 0;
}

• 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