oj.uz

Submission #971775

# Submission time Handle Problem Language Result Execution time Memory
971775 2024-04-29T09:22:17 Z Niosakaru Skyscraper (JOI16_skyscraper) C++17
100 / 100
 69 ms 50772 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const ll MOD = 1e9 + 7;

int a[102];
ll dp[102][102][1002][3];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, l;
    cin >> n >> l;
    if (n == 1) return cout << 1, 0;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + n + 1);
    a[n + 1] = 10000;
    dp[0][0][0][0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            for (int k = 0; k <= l; k++) {
                for (int m = 0; m <= 2; m++) {
                    int cost_diff = (2 * j - m) * (a[i + 1] - a[i]);
                    if (cost_diff > k || i + j + 1 - m > n) continue;

                    // Case 1
                    dp[i][j][k][m] += dp[i - 1][j - 1][k - cost_diff][m];
                    // Case 2
                    if (m)
                        dp[i][j][k][m] +=
                            (3 - m) * dp[i - 1][j - 1][k - cost_diff][m - 1];
                    // Case 3
                    dp[i][j][k][m] +=
                        (2 * j - m) * dp[i - 1][j][k - cost_diff][m];
                    // Case 4
                    if (m == 1)
                        dp[i][j][k][m] +=
                            2 * j * dp[i - 1][j][k - cost_diff][m - 1];
                    if (m == 2) {
                        if (i == n)
                            dp[i][j][k][m] +=
                                dp[i - 1][j][k - cost_diff][m - 1];
                        else if (j > 1)
                            dp[i][j][k][m] +=
                                (j - 1) * dp[i - 1][j][k - cost_diff][m - 1];
                    }
                    // Case 5
                    if (m == 2) {
                        if (i == n)
                            dp[i][j][k][m] +=
                                dp[i - 1][j + 1][k - cost_diff][m];
                        else
                            dp[i][j][k][m] +=
                                j * (j - 1) *
                                dp[i - 1][j + 1][k - cost_diff][m];
                    } else if (m == 1)
                        dp[i][j][k][m] +=
                            j * j * dp[i - 1][j + 1][k - cost_diff][m];
                    else
                        dp[i][j][k][m] +=
                            j * (j + 1) * dp[i - 1][j + 1][k - cost_diff][m];

                    dp[i][j][k][m] %= MOD;
                    if (!dp[i][j][k][m]) continue;

                }
            }
        }
    }

    ll ans = 0;
    for (int i = 0; i <= l; i++) ans += dp[n][1][i][2];
    cout << ans % MOD;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 552 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 864 KB Output is correct
10 Correct 1 ms 460 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 608 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 552 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 864 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 608 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 2392 KB Output is correct
22 Correct 46 ms 35776 KB Output is correct
23 Correct 69 ms 47444 KB Output is correct
24 Correct 60 ms 46932 KB Output is correct
25 Correct 67 ms 50772 KB Output is correct
26 Correct 57 ms 46260 KB Output is correct
27 Correct 23 ms 23632 KB Output is correct
28 Correct 28 ms 26976 KB Output is correct
29 Correct 52 ms 41404 KB Output is correct
30 Correct 66 ms 50768 KB Output is correct