제출 #393961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393961		jadDebugs	A Huge Tower (CEOI10_tower)	C++14	35 / 100	301 ms	6596 KiB

tower

#include <iostream>
#include <algorithm>

#include <vector>
using namespace std;

const int mod = 1e9+9;

int main()
{
    int n, d; cin >> n >> d;

    vector<int> arr(n);
    vector<int> dp(n);
    dp[0] = 1;

    for (int i = 0; i < n; i++)
        cin >> arr[i];
    sort(arr.begin(), arr.end());
    
    int l = 0;
    for (int r = 1; r < n; r++) {
        while (l < r && arr[l] + d < arr[r])
            l++;
        dp[r] = ((r-l+1) * dp[r-1]) % mod;
        dp[r] %= mod;
    }

    cout << dp[n-1];
}

• 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: 5 / 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