Submission #273788

#	Time	Username	Problem	Language	Result	Execution time	Memory
273788		shrek12357	A Huge Tower (CEOI10_tower)	C++14	30 / 100	601 ms	21224 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<int> nums;
	map<int, int> indexes;
	for (int i = 0; i < n; i++) {
		int temp;
		cin >> temp;
		nums.push_back(temp);
	}
	sort(nums.begin(), nums.end());
	int dp = 1;
	set<int> curNums;
	set<int>::iterator it;
	curNums.insert(nums[0]);
	indexes[nums[0]] = 0;
	int lol = 0;
	for (int i = 1; i < n; i++) {
		it = curNums.lower_bound(nums[i] - d);
		if (it == curNums.end()) {
			lol++;
		}
		else {
			dp = (dp * (i - indexes[*it] + 1) + MOD) % MOD;
		}
		curNums.insert(nums[i]);
		if (indexes.find(nums[i]) == indexes.end()) {
			indexes[nums[i]] = i;
		}
	}
	cout << dp << endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5