Submission #1289395

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289395		packmani	A Huge Tower (CEOI10_tower)	C++20	90 / 100	1097 ms	5244 KiB

tower

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const ll N=1e6+5;
const ll mod=1e9+9;
ll n,d,p,tmp;
ll arr[N];
ll ans;
int32_t main()
{
	cin >> n >> d;
	for(int i=0;i<n;i++)
	{
		cin >> arr[i];
	}
	//a,b,c -> a<=b+d, b<=c+d
	//sort asc -> we want to put b, a<=b+d always true (assume d is positive) -> check only b<=c+d
	//a+d<=b, b+d<=c
	sort(arr,arr+n);
	ans=1;
	for(int i=0;i<n;i++)
	{
		p=0;
		tmp = ans;
		for(int j=0;j<i;j++)
			if(arr[i]<=arr[j]+d) p++;
		ans = tmp*p;
		ans %= mod;
		ans += tmp;
		ans %= mod;
	}
	cout << ans;
}

• 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: 0 / 5
• Subtask 20: 0 / 5