#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int MOD = 1e9+7, Z = 1e2 + 1;
int N, L, A[Z], dp[Z][1001][4], prv[Z][1001][4];
#define P(X, Y, VAL) if(_j <= L) (dp[i+X][_j][k+Y] += prv[i][j][k] * (VAL)) %= MOD;
int32_t main() {
cin >> N >> L;
for(int i = N; i--; )
cin >> A[i];
sort(A, A + N);
dp[1][0][0] = 1;
dp[1][0][1] = 2;
for(int c = 1; c < N; ++c) {
swap(prv, dp);
memset(dp, 0, sizeof dp);
for(int i = 1; i < N; ++i) {
for(int j = 0; j < L; ++j) {
for(int k = 0; k < 3; ++k) {
int _j = j + (A[c] - A[c-1]) * (2 * i - k);
P(1, 0, i + 1 - k);
P(-1, 0, i - 1);
P(0, 0, 2 * i - k);
P(1, 1, 1 + !k);
P(0, 1, 1 + !k);
}
}
}
}
int ans {};
for(int i = 0; i <= L; ++i)
(ans += dp[1][i][2]) %= MOD;
cout << (N < 2 ? 1 : ans);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
212 KB |
Output is correct |
| 2 |
Correct |
4 ms |
6576 KB |
Output is correct |
| 3 |
Correct |
5 ms |
6612 KB |
Output is correct |
| 4 |
Correct |
6 ms |
6612 KB |
Output is correct |
| 5 |
Correct |
8 ms |
6640 KB |
Output is correct |
| 6 |
Correct |
7 ms |
6580 KB |
Output is correct |
| 7 |
Correct |
7 ms |
6612 KB |
Output is correct |
| 8 |
Correct |
7 ms |
6612 KB |
Output is correct |
| 9 |
Correct |
8 ms |
6632 KB |
Output is correct |
| 10 |
Correct |
7 ms |
6580 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
6612 KB |
Output is correct |
| 2 |
Correct |
10 ms |
6612 KB |
Output is correct |
| 3 |
Correct |
11 ms |
6588 KB |
Output is correct |
| 4 |
Correct |
11 ms |
6612 KB |
Output is correct |
| 5 |
Correct |
11 ms |
6612 KB |
Output is correct |
| 6 |
Correct |
10 ms |
6612 KB |
Output is correct |
| 7 |
Correct |
11 ms |
6580 KB |
Output is correct |
| 8 |
Correct |
14 ms |
6584 KB |
Output is correct |
| 9 |
Correct |
12 ms |
6584 KB |
Output is correct |
| 10 |
Correct |
10 ms |
6612 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
212 KB |
Output is correct |
| 2 |
Correct |
4 ms |
6576 KB |
Output is correct |
| 3 |
Correct |
5 ms |
6612 KB |
Output is correct |
| 4 |
Correct |
6 ms |
6612 KB |
Output is correct |
| 5 |
Correct |
8 ms |
6640 KB |
Output is correct |
| 6 |
Correct |
7 ms |
6580 KB |
Output is correct |
| 7 |
Correct |
7 ms |
6612 KB |
Output is correct |
| 8 |
Correct |
7 ms |
6612 KB |
Output is correct |
| 9 |
Correct |
8 ms |
6632 KB |
Output is correct |
| 10 |
Correct |
7 ms |
6580 KB |
Output is correct |
| 11 |
Correct |
9 ms |
6612 KB |
Output is correct |
| 12 |
Correct |
10 ms |
6612 KB |
Output is correct |
| 13 |
Correct |
11 ms |
6588 KB |
Output is correct |
| 14 |
Correct |
11 ms |
6612 KB |
Output is correct |
| 15 |
Correct |
11 ms |
6612 KB |
Output is correct |
| 16 |
Correct |
10 ms |
6612 KB |
Output is correct |
| 17 |
Correct |
11 ms |
6580 KB |
Output is correct |
| 18 |
Correct |
14 ms |
6584 KB |
Output is correct |
| 19 |
Correct |
12 ms |
6584 KB |
Output is correct |
| 20 |
Correct |
10 ms |
6612 KB |
Output is correct |
| 21 |
Correct |
27 ms |
6628 KB |
Output is correct |
| 22 |
Correct |
170 ms |
6612 KB |
Output is correct |
| 23 |
Correct |
186 ms |
6612 KB |
Output is correct |
| 24 |
Correct |
167 ms |
6612 KB |
Output is correct |
| 25 |
Correct |
194 ms |
6612 KB |
Output is correct |
| 26 |
Correct |
167 ms |
6616 KB |
Output is correct |
| 27 |
Correct |
94 ms |
6612 KB |
Output is correct |
| 28 |
Correct |
111 ms |
6612 KB |
Output is correct |
| 29 |
Correct |
168 ms |
6612 KB |
Output is correct |
| 30 |
Correct |
180 ms |
6620 KB |
Output is correct |
