| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 902578 | Spade1 | Skyscraper (JOI16_skyscraper) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll ll>
#define st first
#define nd second
#define pb push_back
using namespace std;
const int maxN = 1e2 + 10;
const int maxL = 1e3 + 10;
const int M = 1e9 + 7;
ll dp[maxN][maxN][10*maxL][3], a[maxN];
void solve() {
ll n, l; cin >> n >> l;
if (n == 1) {
cout << 1 << '\n';
return;
}
for (int i = 1; i <= n; ++i) cin >> a[i];
sort(a+1, a+n+1);
dp[0][0][5*l][0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
for (int k = 0; k <= 10*l; ++k) {
if (k+2*a[i] <= 10*l) {
dp[i][j][k][0] = (dp[i][j][k][0] + j*dp[i-1][j-1][k+2*a[i]][0]) % M;
dp[i][j][k][1] = (dp[i][j][k][1] + (j-1)*dp[i-1][j-1][k+2*a[i]][1]) % M;