제출 #321271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321271		xyzyzl	A Huge Tower (CEOI10_tower)	C++14	100 / 100	307 ms	17892 KiB

tower

#include <bits/stdc++.h>

#define MOD 1000000009
#define ll long long
using namespace std;

int n, d, a[1000005];
ll w[1000005], tot[1000005];
int main()
{
	cin >> n >> d; for(int i = 0; i < n; i++) cin >> a[i];
	sort(a, a+n);
	tot[0] = 1;
	int lo=0;
	for(int i = 0; i < n; i++)
	{
		while(a[lo]+d < a[i]) lo++;
		w[i] = (i-lo)+1;
	}
	// for(int i = 0; i < n; i++) cerr << w[i] << endl;
	for(int i = 1; i < n; i++)
	{
		tot[i] = (tot[i-1]*w[i]) % MOD;
	}
	cout << tot[n-1] << 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