제출 #1332006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1332006		timeforclock	A Huge Tower (CEOI10_tower)	C++20	90 / 100	1096 ms	9868 KiB

tower

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const ll MOD = (ll)(1e9 + 9);

int main() {
	ll N, d; cin >> N >> d;
    vector<ll> a(N);
    for (ll i = 0; i < N; i++) cin >> a[i];
    sort(a.begin(), a.end());
    vector<ll> dp(N); dp[0] = 1;

    for (ll i = 1; i < N; i++) {
        ll r = i;
        while (r >= 1 && a[i]-a[r-1] <= d) r--;
        dp[i] = (dp[i-1]*(i-r+1)) % MOD;
    }

    cout << dp.back();
}

• 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