oj.uz

Submission #775440

# Submission time Handle Problem Language Result Execution time Memory
775440 2023-07-06T11:43:07 Z PoonYaPat Skyscraper (JOI16_skyscraper) C++14
15 / 100
 1 ms 980 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll mod=1e9+7;
int n,lim,a[105];
ll dp[105][105][1005][3];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>lim;
    for (int i=1; i<=n; ++i) cin>>a[i];
    sort(a+1,a+n+1);

    dp[1][1][0][0]=1;
    dp[1][1][0][1]=2;

    for (int i=2; i<=n; ++i) {
        for (int j=1; j<i; ++j) {
            for (int k=0; k<=lim; ++k) {
                for (int e=0; e<3; ++e) {
                    //consider value from dp[i-1][j][k][e]
                    int nw=k+(a[i]-a[i-1])*(2*j-e);
                    if (nw>lim) continue;

                    //insert to middle component
                    dp[i][j][nw][e]=(dp[i][j][nw][e]+dp[i-1][j][k][e]*(2*j-e))%mod;

                    //insert to rim component
                    dp[i][j][nw][e+1]=(dp[i][j][nw][e+1]+dp[i-1][j][k][e]*(2-e))%mod;

                    //merge 2 component
                    dp[i][j-1][nw][e]=(dp[i][j-1][nw][e]+dp[i-1][j][k][e]*(j-1))%mod;

                    //create new middle component
                    dp[i][j+1][nw][e]=(dp[i][j+1][nw][e]+dp[i-1][j][k][e]*(j+1-e))%mod;

                    //create new rim component
                    dp[i][j+1][nw][e+1]=(dp[i][j+1][nw][e+1]+dp[i-1][j][k][e]*(2-e))%mod;
                    
                }
            }
        }
    }

    ll ans=0;
    for (int k=0; k<=lim; ++k) ans=(ans+dp[n][1][k][2])%mod;
    cout<<ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 968 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 960 KB Output is correct
10 Correct 1 ms 852 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -