제출 #488683

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
488683		asamanta	A Huge Tower (CEOI10_tower)	C++14	100 / 100	258 ms	4608 KiB

tower

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

using namespace std;

const int mod = 1000000009;

int main() {
    
    int n, d;
    cin >> n >> d;
    
    vector<int> a(n);
    
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    
    sort(a.begin(), a.end());
    
    int cur_block = 0, check = 0;
    
    long long total = 1;
    
    while (cur_block < n) {
        
        while (check < n) {
            if (a[cur_block] + d < a[check])
                break;
            check++;
        }
        
        total = (total * (check - cur_block)) % mod;
        
        cur_block++;
        
    }
    
    cout << total << "\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: 5 / 5
• Subtask 20: 5 / 5