제출 #519088

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
519088		faefeyfa	A Huge Tower (CEOI10_tower)	C++14	0 / 100	258 ms	14788 KiB

tower

#include <bits/stdc++.h>
#define MOD 1000000009ll
using namespace std;
using ll = long long;
int main()
{
	int num, tol;
	cin >> num >> tol;
	ll* blocks = new ll[num];
	for(int ii = 0; ii < num; ii++)
		cin >> blocks[ii];
	sort(blocks,blocks+num,greater<>());
	int l;
	l = 0;
	ll* addable = new ll[num];
	for(int r = 0; r < num; r++)
	{
		while(blocks[l]+tol < blocks[r])
			l++;
		addable[r] = l;
	}
	ll* ans = new ll[num];
	ans[0] = 1;
	for(int ii = 1; ii < num; ii++)
	{
		ans[ii] = ans[ii-1]*addable[ii];
		ans[ii] %= MOD;
	}
	cout << ans[num-1] << '\n';
	return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 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