제출 #855333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
855333		magikrap	A Huge Tower (CEOI10_tower)	C++17	30 / 100	247 ms	9964 KiB

tower

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#include <cstring>
#include <bitset>
#include <string>

#define ll long long

using namespace std;

int N, D;
vector<ll> a;
ll MOD = 1e9+7;

int main() {
    cin >> N >> D;
    a.resize(N);
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    ll ans = 1;
    for (int i = 0; i < N; i++) {
        int idx = lower_bound(a.begin(), a.end(), a[i]-D) - a.begin();
        ans *= (i-idx+1);
        ans %= MOD;
    }
    cout << ans << endl;
}

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