제출 #1128933

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128933		anonymous321	A Huge Tower (CEOI10_tower)	C++20	100 / 100	107 ms	10052 KiB

tower

// https://oj.uz/problem/view/CEOI10_tower
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 9;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    ll d;
    cin >> n >> d;
    vector<ll> v (n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    
    sort(v.begin(), v.end());
    vector<ll> comp (n, 0);
    int cur = 1;
    for (int i = 0; i < n; i++) {
        int cnt = 0;
        cur = max(cur, i + 1);
        while (cur < n && v[cur] <= v[i] + d) {
            cnt++;
            cur++;
        }
        if (i > 0) comp[i] = max(0LL, comp[i-1] - 1);
        comp[i] += cnt;
    }
    
    ll sol = 1;
    for (int i = n-2; i >= 0; i--) {
        ll x = 1 + comp[i];
        x = x % M;
        sol = (sol * x) % M;
    }
    cout << sol << "\n";
    return 0;
}

• 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