제출 #1222614

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

tower

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

const int MOD = 1e9 + 9;

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

	sort(blocks.begin(), blocks.end());  // sort the blocks

	int right = 0;
	int res = 1;
	for (int left = 0; left < n; left++) {
		while (right < n - 1 && blocks[right + 1] - blocks[left] <= d) { right++; }
		// lblocksgest tower we can built when blocks[left] block is the base
		int dist = right - left + 1;
		res = (res * 1LL * dist) % MOD;
	}

	std::cout << res << '\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