제출 #1321893

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1321893		hansen	A Huge Tower (CEOI10_tower)	C++20	25 / 100	73 ms	10040 KiB

tower

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb pushback
mt19937 rng((int)chrono::steady_clock::now().time_since_epoch().count());
int hashp = uniform_int_distribution<int>(10, 1e9)(rng);
int hashm1 = 1e9+7;
int hashm2 = 1e9+9;
int MOD = 1e9+7;
int MV = 1e18;

void solve(){
    int n, d;
    cin >> n >> d;
    int res = 1;
    vector<int> a(n), p(n+1, 1);
    for(int i = 0; i < n; i++) cin >> a[i];
    sort(a.begin(), a.end(), greater<>());
    for(int i = 1; i <= n; i++){
        p[i] = p[i-1]*i;
        p[i] %= MOD;
    }  
    for(int i = 0; i < n; i++){
        int j = i;
        while(j+1 < n && a[j+1]+d >= a[i]){
            j++;
        }
        res *= p[j-i+1];
        if(i != j) i = j-1;
    }
    cout << res;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

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