# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
860951 | blackslex | Skyscraper (JOI16_skyscraper) | C++17 | 56 ms | 43372 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>
using namespace std;
const int N = 105, L = 1005, M = 1e9 + 7;
int n, d, a[N], dp[N][N][L][3];
int main() {
scanf("%d %d", &n, &d);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]); sort(a + 1, a + n + 1);
dp[1][1][0][0] = 1; dp[1][1][0][1] = 2;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= i; j++) {
for (int l = 0; l <= d; l++) {
for (int k = 0; k < 3; k++) {
int cur = l + (a[i + 1] - a[i]) * (j * 2 - k);
if (cur > d) continue;
dp[i + 1][j - 1][cur][k] += (j - 1) * dp[i][j][l][k]; dp[i + 1][j - 1][cur][k] %= M; // add, merge
dp[i + 1][j][cur][k] += (j * 2 - k) * dp[i][j][l][k]; dp[i + 1][j][cur][k] %= M; // add, merge one ending point
dp[i + 1][j + 1][cur][k] += (j + 1 - k) * dp[i][j][l][k]; dp[i + 1][j + 1][cur][k] %= M; // add, no merge
if (k == 2) continue;
dp[i + 1][j][cur][k + 1] += (2 - k) * dp[i][j][l][k]; dp[i + 1][j][cur][k + 1] %= M; // add, fix, merge
dp[i + 1][j + 1][cur][k + 1] = (2 - k) * dp[i][j][l][k]; dp[i + 1][j + 1][cur][k + 1] %= M; // add, fix, no merge
}
}
}
}
for (int i = 1; i <= d; i++) dp[n][1][i][2] += dp[n][1][i - 1][2], dp[n][1][i][2] %= M;
printf("%d", dp[n][1][d][2] + (n == 1));
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |