제출 #928054

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

tower

// In the name of God
// Hope is last to die

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
// #define int long long    
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())

const int maxn = 2e6 + 5;
const int inf = 1e9 + 7, mod = 1e9 + 7;
ll n, d, a[maxn];

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> d;
    for(int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    ll cur = 0, ans = 1;
    for(int i = 0; i < n; i++){
        while(a[cur] + d < a[i]) cur++;
        ans = (1ll * ans * (i - cur + 1)) % mod;
    }
    cout << ans << '\n';

    return 0;
}

• 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