| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1294266 | eldaees131313 | Skyscraper (JOI16_skyscraper) | C++20 | 0 ms | 0 KiB |
////////////////////////////// Author:eldaee, coder_viper
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define int long long
#define str string
#define vec vector
#define dou double
#define ld long double
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define YES cout << "YES" << '\n'
#define Yes cout << "Yes" << '\n'
#define NO cout << "NO" << '\n'
#define No cout << "No" << '\n'
#define gcd __gcd
#define all(x) x.begin(),x.end()
#define eldaee ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
/*
*/
const int mod = 1000000005;
void solve() {
int n, l;
cin >> n >> l;
vec<int> v(n);
for (auto &i : v) {
cin >> i;
}
int ans = 0;
sort(all(v));
int sm = 0;
for (int j = 0; j < n - 1; j++) {
sm += abs(v[i + 1] - v[i]);
}
if (sm <= l) {
ans++;
ans %= mod;
}
while(next_permutation(all(v)) != 0) {
int sm = 0;
for (int j = 0; j < n - 1; j++) {
sm += abs(v[i + 1] - v[i]);
}
if (sm <= l) {
ans++;
ans %= mod;
}
}
cout << ans << '\n';
}
signed main()
{
eldaee
solve();
}
