Submission #480395

#	Time	Username	Problem	Language	Result	Execution time	Memory
480395		nehasane	A Huge Tower (CEOI10_tower)	C++14	90 / 100	1091 ms	3672 KiB

tower

#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000009;
int main()
{
    int n, d;
    cin >> n >> d;
    vector <int> blocks(n);
    for (int i = 0; i < n; i++)
        cin >> blocks[i];
    sort(begin(blocks), end(blocks));
    long long ans = 1;
    for (int l = 0; l < n; l++){
        int r = l;
        while (r < n){
            if (blocks[l] + d < blocks[r])
                break;
            r++;
        }
        ans = (ans * (r-l)) % mod;
    }
    cout << ans << '\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: 0 / 5
• Subtask 20: 0 / 5