Submission #346581

#	Time	Username	Problem	Language	Result	Execution time	Memory
346581		Ca7Ac1	A Huge Tower (CEOI10_tower)	C++17	30 / 100	137 ms	14828 KiB

tower

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>

#define ll signed long long

using namespace std;

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

int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    //freopen("tower.in", "r", stdin);

    ll N;
    ll D;
    cin >> N >> D;

    vector<ll> blocks(N, 0);
    for (ll i = 0; i < N; i++)
    {
        cin >> blocks[i];
    }

    sort(blocks.begin(), blocks.end(), greater<ll>());

    vector<ll> place(N, 1);
    ll j = 0;
    for (ll i = 0; i < N; i++)
    {
        while (j < N && blocks[i] - blocks[j] <= D)
        {
            j++;
        }

        place[i] = (j - i) % MOD;
    }

    vector<ll> count(N, 1);
    for (ll i = N - 2; i >= 0; i--)
    {
        count[i] = count[i + 1] * place[i];
        count[i] %= MOD;
    }

    cout << ((count[1] * place[0]) % MOD);
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5