oj.uz

Submission #902586

# Submission time Handle Problem Language Result Execution time Memory
902586 2024-01-10T18:30:39 Z Spade1 Skyscraper (JOI16_skyscraper) C++14
20 / 100
 609 ms 524288 KB 
#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 + 2;
const int maxL = 1e3 + 2;
const int M = 1e9 + 7;

ll dp[maxN][maxN][4*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][3*l][0] = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            for (int k = 0; k <= 4*l; ++k) {
                if (k+2*a[i] <= 4*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;
                    dp[i][j][k][2] = (dp[i][j][k][2] + (j-2)*dp[i-1][j-1][k+2*a[i]][2]) % M;
                }
                if (k+a[i] <= 4*l) {
                    dp[i][j][k][1] = (dp[i][j][k][1] + 2*dp[i-1][j-1][k+a[i]][0]) % M;
                    dp[i][j][k][2] = (dp[i][j][k][2] + dp[i-1][j-1][k+a[i]][1]) % M;
                }
                dp[i][j][k][0] = (dp[i][j][k][0] + (2*j)*dp[i-1][j][k][0]) % M;
                dp[i][j][k][1] = (dp[i][j][k][1] + (2*j-1)*dp[i-1][j][k][1]) % M;
                dp[i][j][k][2] = (dp[i][j][k][2] + (2*j-2)*dp[i-1][j][k][2]) % M;
                if (k-a[i] >= 0) {
                    dp[i][j][k][1] = (dp[i][j][k][1] + 2*dp[i-1][j][k-a[i]][0]) % M;
                    dp[i][j][k][2] = (dp[i][j][k][2] + dp[i-1][j][k-a[i]][1]) % M;
                }
                if (k-2*a[i] >= 0) {
                    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*dp[i-1][j+1][k-2*a[i]][1]) % M;
                    dp[i][j][k][2] = (dp[i][j][k][2] + j*dp[i-1][j+1][k-2*a[i]][2]) % M;
                }
            }
        }
    }
    ll ans = 0;
    for (int i = 3*l; i <= 4*l; ++i) {
        ans += dp[n][1][i][2];
        ans %= M;
    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) solve();
}

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 1 ms 860 KB Output is correct
5 Correct 7 ms 6360 KB Output is correct
6 Correct 7 ms 5720 KB Output is correct
7 Correct 2 ms 1628 KB Output is correct
8 Correct 1 ms 1224 KB Output is correct
9 Correct 8 ms 6120 KB Output is correct
10 Correct 2 ms 1368 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 3 ms 2908 KB Output is correct
3 Correct 2 ms 2136 KB Output is correct
4 Correct 3 ms 2908 KB Output is correct
5 Correct 4 ms 2908 KB Output is correct
6 Correct 4 ms 2908 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 2 ms 2140 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 3 ms 2652 KB Output is correct

Subtask #3
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 1 ms 860 KB Output is correct
5 Correct 7 ms 6360 KB Output is correct
6 Correct 7 ms 5720 KB Output is correct
7 Correct 2 ms 1628 KB Output is correct
8 Correct 1 ms 1224 KB Output is correct
9 Correct 8 ms 6120 KB Output is correct
10 Correct 2 ms 1368 KB Output is correct
11 Correct 2 ms 1880 KB Output is correct
12 Correct 3 ms 2908 KB Output is correct
13 Correct 2 ms 2136 KB Output is correct
14 Correct 3 ms 2908 KB Output is correct
15 Correct 4 ms 2908 KB Output is correct
16 Correct 4 ms 2908 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 2 ms 2140 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 3 ms 2652 KB Output is correct
21 Correct 12 ms 12892 KB Output is correct
22 Correct 598 ms 495068 KB Output is correct
23 Runtime error 609 ms 524288 KB Execution killed with signal 9
24 Halted 0 ms 0 KB -