oj.uz

Submission #902595

# Submission time Handle Problem Language Result Execution time Memory
902595 2024-01-10T18:50:38 Z Spade1 Skyscraper (JOI16_skyscraper) C++14
20 / 100
 1472 ms 33704 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][7*maxL][3], tmp[maxN][7*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);
    tmp[0][4*l][0] = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            for (int k = 0; k <= 7*l; ++k) {
                if (k+2*a[i] <= 7*l) {
                    dp[j][k][0] = (dp[j][k][0] + j*tmp[j-1][k+2*a[i]][0]) % M;
                    dp[j][k][1] = (dp[j][k][1] + (j-1)*tmp[j-1][k+2*a[i]][1]) % M;
                    dp[j][k][2] = (dp[j][k][2] + (j-2)*tmp[j-1][k+2*a[i]][2]) % M;
                }
                if (k+a[i] <= 7*l) {
                    dp[j][k][1] = (dp[j][k][1] + 2*tmp[j-1][k+a[i]][0]) % M;
                    dp[j][k][2] = (dp[j][k][2] + tmp[j-1][k+a[i]][1]) % M;
                }
                dp[j][k][0] = (dp[j][k][0] + (2*j)*tmp[j][k][0]) % M;
                dp[j][k][1] = (dp[j][k][1] + (2*j-1)*tmp[j][k][1]) % M;
                dp[j][k][2] = (dp[j][k][2] + (2*j-2)*tmp[j][k][2]) % M;
                if (k-a[i] >= 0) {
                    dp[j][k][1] = (dp[j][k][1] + 2*tmp[j][k-a[i]][0]) % M;
                    dp[j][k][2] = (dp[j][k][2] + tmp[j][k-a[i]][1]) % M;
                }
                if (k-2*a[i] >= 0) {
                    dp[j][k][0] = (dp[j][k][0] + j*tmp[j+1][k-2*a[i]][0]) % M;
                    dp[j][k][1] = (dp[j][k][1] + j*tmp[j+1][k-2*a[i]][1]) % M;
                    dp[j][k][2] = (dp[j][k][2] + j*tmp[j+1][k-2*a[i]][2]) % M;
                }
            }
        }
        for (int j = 0; j <= n; ++j) {
            for (int k = 0; k <= 7*l; ++k) {
                tmp[j][k][0] = dp[j][k][0];
                tmp[j][k][1] = dp[j][k][1];
                tmp[j][k][2] = dp[j][k][2];
                dp[j][k][0] = dp[j][k][1] = dp[j][k][2] = 0;
            }
        }
    }
    ll ans = 0;
    for (int i = 4*l; i <= 5*l; ++i) {
        ans += tmp[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 424 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 11 ms 3488 KB Output is correct
6 Correct 9 ms 2904 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 10 ms 3164 KB Output is correct
10 Correct 2 ms 860 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 1 ms 744 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 856 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 424 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 11 ms 3488 KB Output is correct
6 Correct 9 ms 2904 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 10 ms 3164 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 3 ms 1112 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 1 ms 744 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 3 ms 860 KB Output is correct
20 Correct 3 ms 856 KB Output is correct
21 Correct 9 ms 1116 KB Output is correct
22 Correct 796 ms 22428 KB Output is correct
23 Correct 1472 ms 33704 KB Output is correct
24 Incorrect 1130 ms 25908 KB Output isn't correct
25 Halted 0 ms 0 KB -