Submission #513902

#	Time	Username	Problem	Language	Result	Execution time	Memory
513902		heroescharge	A Huge Tower (CEOI10_tower)	C++14	100 / 100	267 ms	10632 KiB

tower

#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int N, D;

int f(int arr[]) {
    int p1loc = 0;
    int p1val = 0;
    int p2loc = 0;

    int vals[N];

    while (p2loc < N) {
        while (arr[p1loc] <= arr[p2loc] + D && p1loc < N) {
            p1loc++;
            p1val++;
        }
        vals[p2loc] = p1val;
        p2loc++;
        p1val--;
    }

    long long int prod = 1;
    int M = 1000000009;
    long long int p;
    for (int i = 0; i < N; i++) {
        p = prod * (vals[i] % M);
        prod  = p % M;
    }

    return prod;
}

int main() {
    cin >> N  >> D;
    int arr[N];
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }
    sort(arr, arr + N);
    cout << f(arr);
}

• 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