제출 #1135380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135380		mnbvcxz123	A Huge Tower (CEOI10_tower)	C++20	100 / 100	181 ms	2840 KiB

tower

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

const int MOD = 1e9 + 9;

int main() {
	int n, d;
	cin >> n >> d;
	vector<int> ar(n);
	for (int i = 0; i < n; i++) { cin >> ar[i]; }

	sort(ar.begin(), ar.end());

	int r = 0;
	int sol = 1;
	for (int l = 0; l < n; l++) {
		while (r < n - 1 && ar[r + 1] - ar[l] <= d) { r++; }
		int dist = r - l + 1;
		sol = (sol * 1LL * dist) % MOD;
	}

	cout << sol << endl;
}

• 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