#include <bits/stdc++.h>
//#pragma GCC optimize ("03")
#define FastIO ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#define FILES freopen("in" , "r" , stdin) , freopen("out" , "w" , stdout)
#define ll long long
#define uint unsigned long long
#define ld long double
#define eb emplace_back
#define pb push_back
#define qwerty1 first
#define qwerty2 second
#define qwerty3 -> first
#define qwerty4 -> second
#define umap unordered_map
#define uset unordered_set
#define pii pair < int , int >
#define pq priority_queue
#define dbg(x) cerr << #x << ": " << x << '\n'
namespace FastRead
{
char __buff[5000];int __lg = 0 , __p = 0;
char nc()
{
if(__lg == __p){__lg = fread(__buff , 1 , 5000 , stdin);__p = 0;if(!__lg) return EOF;}
return __buff[__p++];
}
template<class T>void read(T&__x)
{
T __sgn = 1; char __c;while(!isdigit(__c = nc()))if(__c == '-')__sgn = -1;
__x = __c - '0';while(isdigit(__c = nc()))__x = __x * 10 + __c - '0';__x *= __sgn;
}
}
using namespace FastRead;
using namespace std;
const int N = 1e2 + 10;
const int L = 4e3 + 10;
const int M = 1e9 + 7;
const ld PI = acos(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n , l;
int a[N];
//array < array < array < int , 4 > , 2 * L > , N > dp1 , dp_old;
int curr_dp[N][2 * L][4] , old_dp[N][2 * L][4];
void add(int &x , int y)
{
y %= M;
x += y;
x %= M;
}
signed main()
{
// #ifndef ONLINE_JUDGE
// FastIO , FILES;
// #endif
int i , j , s;
cin >> n >> l;
for(i = 1 ; i <= n ; i++)
cin >> a[i];
sort(a + 1 , a + n + 1);
old_dp[1][0 + L][0] = 1;
old_dp[1][-a[1] + L][1] = 1;
old_dp[1][-a[1] + L][2] = 1;
old_dp[1][-2 * a[1] + L][3] = 1;
for(i = 2 ; i <= n ; i++)
{
for(j = 1 ; j <= i ; j++)
{
for(s = -4 * l ; s <= 4 * l ; s++)
{
///merge
if(s - 2 * a[i] + L >= 0)
{
add(curr_dp[j][s + L][0] , 1ll * j * old_dp[j + 1][s - 2 * a[i] + L][0]);
add(curr_dp[j][s + L][1] , 1ll * j * old_dp[j + 1][s - 2 * a[i] + L][1]);
add(curr_dp[j][s + L][2] , 1ll * j * old_dp[j + 1][s - 2 * a[i] + L][2]);
add(curr_dp[j][s + L][3] , 1ll * j * old_dp[j + 1][s - 2 * a[i] + L][3]);
}
///concat
add(curr_dp[j][s + L][0] , 1ll * (2 * j - 2) * old_dp[j][s + L][0]);
add(curr_dp[j][s + L][1] , 1ll * (2 * j - 2) * old_dp[j][s + L][1]);
add(curr_dp[j][s + L][2] , 1ll * (2 * j - 2) * old_dp[j][s + L][2]);
add(curr_dp[j][s + L][3] , 1ll * (2 * j - 2) * old_dp[j][s + L][3]);
if(s - a[i] + L >= 0) add(curr_dp[j][s + L][0] , old_dp[j][s - a[i] + L][1]);
if(s - a[i] + L >= 0) add(curr_dp[j][s + L][2] , old_dp[j][s - a[i] + L][3]);
add(curr_dp[j][s + L][1] , old_dp[j][s + L][1]);
add(curr_dp[j][s + L][3] , old_dp[j][s + L][3]);
// add(curr_dp[j][s + L][3] , old_dp[j][s + L][1]);
if(s - a[i] + L >= 0) add(curr_dp[j][s + L][0] , old_dp[j][s - a[i] + L][2]);
add(curr_dp[j][s + L][2] , old_dp[j][s + L][2]);
add(curr_dp[j][s + L][3] , old_dp[j][s + L][3]);
if(s - a[i] + L >= 0) add(curr_dp[j][s + L][1] , old_dp[j][s - a[i] + L][3]);
// add(curr_dp[j][s + L][3] , old_dp[j][s + L][2]);
///new
if(j > 2 && s + 2 * a[i] + L < 2 * L)
{
add(curr_dp[j][s + L][0] , 1ll * (j - 2) * old_dp[j - 1][s + 2 * a[i] + L][0]);
add(curr_dp[j][s + L][1] , 1ll * (j - 2) * old_dp[j - 1][s + 2 * a[i] + L][1]);
add(curr_dp[j][s + L][2] , 1ll * (j - 2) * old_dp[j - 1][s + 2 * a[i] + L][2]);
add(curr_dp[j][s + L][3] , 1ll * (j - 2) * old_dp[j - 1][s + 2 * a[i] + L][3]);
}
if(s + a[i] + L < 2 * L) add(curr_dp[j][s + L][0] , old_dp[j - 1][s + a[i] + L][1]);
if(s + a[i] + L < 2 * L) add(curr_dp[j][s + L][0] , old_dp[j - 1][s + a[i] + L][2]);
if(s + 2 * a[i] + L < 2 * L) add(curr_dp[j][s + L][1] , old_dp[j - 1][s + 2 * a[i] + L][1]);
if(s + 2 * a[i] + L < 2 * L) add(curr_dp[j][s + L][2] , old_dp[j - 1][s + 2 * a[i] + L][2]);
if(s + 2 * a[i] + L < 2 * L) add(curr_dp[j][s + L][3] , old_dp[j - 1][s + 2 * a[i] + L][3]);
if(s + 2 * a[i] + L < 2 * L) add(curr_dp[j][s + L][3] , old_dp[j - 1][s + 2 * a[i] + L][3]);
if(s + a[i] + L < 2 * L) add(curr_dp[j][s + L][2] , old_dp[j - 1][s + a[i] + L][3]);
if(s + a[i] + L < 2 * L) add(curr_dp[j][s + L][1] , old_dp[j - 1][s + a[i] + L][3]);
}
}
swap(curr_dp , old_dp);
memset(curr_dp , 0 , sizeof curr_dp);
}
int ans = 0;
for(int s = 0 ; s <= l ; s++)
add(ans , old_dp[1][s + L][0]);
cout << ans;
return 0;
}
Compilation message
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:99:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
99 | if(s - a[i] + L >= 0) add(curr_dp[j][s + L][2] , old_dp[j][s - a[i] + L][3]);
| ^~
skyscraper.cpp:100:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
100 | add(curr_dp[j][s + L][1] , old_dp[j][s + L][1]);
| ^~~
skyscraper.cpp:104:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
104 | if(s - a[i] + L >= 0) add(curr_dp[j][s + L][0] , old_dp[j][s - a[i] + L][2]);
| ^~
skyscraper.cpp:105:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
105 | add(curr_dp[j][s + L][2] , old_dp[j][s + L][2]);
| ^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
23 ms |
27916 KB |
Output is correct |
| 3 |
Correct |
26 ms |
27860 KB |
Output is correct |
| 4 |
Correct |
43 ms |
27860 KB |
Output is correct |
| 5 |
Correct |
69 ms |
27860 KB |
Output is correct |
| 6 |
Correct |
65 ms |
27860 KB |
Output is correct |
| 7 |
Correct |
51 ms |
27860 KB |
Output is correct |
| 8 |
Correct |
60 ms |
27904 KB |
Output is correct |
| 9 |
Correct |
68 ms |
27840 KB |
Output is correct |
| 10 |
Correct |
51 ms |
27900 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
71 ms |
27808 KB |
Output is correct |
| 2 |
Correct |
84 ms |
27904 KB |
Output is correct |
| 3 |
Correct |
82 ms |
27912 KB |
Output is correct |
| 4 |
Correct |
84 ms |
27908 KB |
Output is correct |
| 5 |
Correct |
87 ms |
27848 KB |
Output is correct |
| 6 |
Correct |
85 ms |
27904 KB |
Output is correct |
| 7 |
Correct |
78 ms |
27912 KB |
Output is correct |
| 8 |
Correct |
87 ms |
27908 KB |
Output is correct |
| 9 |
Correct |
105 ms |
27808 KB |
Output is correct |
| 10 |
Correct |
85 ms |
27860 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
23 ms |
27916 KB |
Output is correct |
| 3 |
Correct |
26 ms |
27860 KB |
Output is correct |
| 4 |
Correct |
43 ms |
27860 KB |
Output is correct |
| 5 |
Correct |
69 ms |
27860 KB |
Output is correct |
| 6 |
Correct |
65 ms |
27860 KB |
Output is correct |
| 7 |
Correct |
51 ms |
27860 KB |
Output is correct |
| 8 |
Correct |
60 ms |
27904 KB |
Output is correct |
| 9 |
Correct |
68 ms |
27840 KB |
Output is correct |
| 10 |
Correct |
51 ms |
27900 KB |
Output is correct |
| 11 |
Correct |
71 ms |
27808 KB |
Output is correct |
| 12 |
Correct |
84 ms |
27904 KB |
Output is correct |
| 13 |
Correct |
82 ms |
27912 KB |
Output is correct |
| 14 |
Correct |
84 ms |
27908 KB |
Output is correct |
| 15 |
Correct |
87 ms |
27848 KB |
Output is correct |
| 16 |
Correct |
85 ms |
27904 KB |
Output is correct |
| 17 |
Correct |
78 ms |
27912 KB |
Output is correct |
| 18 |
Correct |
87 ms |
27908 KB |
Output is correct |
| 19 |
Correct |
105 ms |
27808 KB |
Output is correct |
| 20 |
Correct |
85 ms |
27860 KB |
Output is correct |
| 21 |
Correct |
219 ms |
27912 KB |
Output is correct |
| 22 |
Incorrect |
1836 ms |
27904 KB |
Output isn't correct |
| 23 |
Halted |
0 ms |
0 KB |
- |
