제출 #480394

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
480394		nehasane	A Huge Tower (CEOI10_tower)	C++14	15 / 100	306 ms	2704 KiB

tower

#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000009;
long long factorial(int s){
    long long ans = 1;
    for (int i = s; i >= 1; i--)
        ans *= i;
    return ans % mod;
}
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;
    int l = 0, r = 0;
    while (r < n){
        if (blocks[l] + d < blocks[r]){
            ans = (ans * factorial(r-l)) % mod;
            if (blocks[r] + d >= blocks[r+1])
                l = r-1;
            else
                l = r;
        }
        r++;
    }
    cout << ans << '\n';
}

• Subtask 1: 0 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 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