Submission #273812

#	Time	Username	Problem	Language	Result	Execution time	Memory
273812		shrek12357	A Huge Tower (CEOI10_tower)	C++14	100 / 100	628 ms	8788 KiB

tower

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;

#define MOD 1000000009

int main() {
	int n, d;
	cin >> n >> d;
	vector<long long> nums;
	//map<long long, long long> indexes;
	for (int i = 0; i < n; i++) {
		int temp;
		cin >> temp;
		nums.push_back(temp);
	}
	sort(nums.begin(), nums.end());
	long long dp = 1;
	//set<long long> curNums;
	//set<long long>::iterator it;
	vector<long long>::iterator it1;
	//curNums.insert(nums[0]);
	//indexes[nums[0]] = 0;
	int lol = 0;
	for (int i = 1; i < n; i++) {
		it1 = lower_bound(nums.begin(), nums.begin() + i, nums[i] - d);
		if (it1 == nums.end()) {
			lol++;
		}
		else {
			dp = (dp * (i - (it1 - nums.begin()) + 1) + MOD) % MOD;
		}
	}
	cout << dp << 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