Submission #321070

#	Time	Username	Problem	Language	Result	Execution time	Memory
321070		CSQ31	A Huge Tower (CEOI10_tower)	C++14	100 / 100	140 ms	20324 KiB

tower

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+9)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	owo
	ll n,d;
	cin>>n>>d;
	vector<ll>a(n+1),dp(n+1,0),s(n+1,1);
	for(int i=1;i<=n;i++)cin>>a[i];
	dp[0] = 1;
	sort(all(a));
	for(int l=1,r=1;l<=n;l++){
		while(r<=n && a[r]-a[l] <= d){
			s[r] = r-l+1;
			r++;
		}
	};
	for(int i=1;i<=n;i++){
		dp[i] = dp[i-1]*s[i]%MOD;
	}
	cout<<dp[n]<<'\n';
	
}

• 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