Submission #899716

#	Time	Username	Problem	Language	Result	Execution time	Memory
899716		ivaziva	A Huge Tower (CEOI10_tower)	C++14	100 / 100	209 ms	8084 KiB

tower

#include <bits/stdc++.h>


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());  // sort the blocks

	int r = 0, 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;  // largest tower we can built when ar[l] block is the base

		sol = (sol * 1LL * dist) % MOD;

	}

	cout << sol << '\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