제출 #399435

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
399435		winstonyin	A Huge Tower (CEOI10_tower)	C++11	100 / 100	309 ms	13944 KiB

tower

#include <string>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cmath>
#include <array>
#include <map>
#include <set>
#include <fstream>
#include <unordered_map>
using namespace std;
using pi = pair<int, int>;
using pd = pair<double, double>; 
#define all(x) (x).begin(), (x).end()
#define ll long long
int main() {
    int nums, diff; cin >> nums >> diff;
    vector<ll> blocks;
    for(int i = 0; i < nums; i++) {
        ll temp; cin >> temp;
        blocks.push_back(temp);
    }
    sort(all(blocks), greater<ll>());
    ll possibilities = 1;
    int j = 0;
    for(int i = 0; i < nums; i++) {
        while(j < nums && blocks[i]- blocks[j] <= diff) {
            j++;
        }
        // cout << i << " " << j << endl;
        possibilities = (possibilities*(j - i))%(1000000000 + 9);
    }
    cout << possibilities;
    return 0;
}

• 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