Submission #914401

#	Time	Username	Problem	Language	Result	Execution time	Memory
914401		ezGeometry	A Huge Tower (CEOI10_tower)	C++17	100 / 100	221 ms	11344 KiB

tower

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

using namespace std;

const int MOD = 1e9 + 9;

int main() {
	long long n, d;
	cin >> n >> d;

	vector<long long> arr(n);
	for (int i = 0; i < n; i++) { 
		cin >> arr[i];
	}

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

	int r = 0;
	long long sol = 1;

	for (int i = 0; i < n; i++) {
		while (r + 1 < n && arr[r + 1] <= d + arr[i]) {
			r++;
		}
		sol *= ((long long)r - i + 1);
		sol %= MOD;
	}

	cout << sol << endl;

	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