oj.uz

Submission #933391

# Submission time Handle Problem Language Result Execution time Memory
933391 2024-02-25T15:39:21 Z parlimoos Skyscraper (JOI16_skyscraper) C++14
100 / 100
 43 ms 50772 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'

const int MOD = int(1e9) + 7;

int n , l;
vector<int> a;
ll dp[101][101][1001][3];

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> l;
    a.pb(0);
    for(int i = 0 ; i < n ; i++){
        int d;
        cin >> d;
        a.pb(d);
    }
    a.pb(10000);
    if(n == 1){
        cout << 1;
        return 0;
    }
    sort(a.bg() , a.end());
    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 < 3 ; m++){
                    int d = (2 * j - m) * (a[i + 1] - a[i]);
                    if(d > k or i + j + 1 - m > n) continue;
                    dp[i][j][k][m] += dp[i - 1][j - 1][k - d][m];
                    if(m > 0) dp[i][j][k][m] += (3 - m) * dp[i - 1][j - 1][k - d][m - 1];

                    dp[i][j][k][m] += (2 * j - m) * dp[i - 1][j][k - d][m];
                    
                    if(m == 1) dp[i][j][k][m] += (2 * j) * dp[i - 1][j][k - d][m - 1];
                    else if(m == 2){
                        if(i == n) dp[i][j][k][m] += dp[i - 1][j][k - d][m - 1];
                        else if(j > 1) dp[i][j][k][m] += (j - 1) * dp[i - 1][j][k - d][m - 1];
                    }

                    if(m == 2){
                        if(i == n) dp[i][j][k][m] += dp[i - 1][j + 1][k - d][m];
                        else dp[i][j][k][m] += (j - 1) * j * dp[i - 1][j + 1][k - d][m];
                    }else if(m == 1) dp[i][j][k][m] += j * j * dp[i - 1][j + 1][k - d][m];
                    else dp[i][j][k][m] += j * (j + 1) * dp[i - 1][j + 1][k - d][m];

                    dp[i][j][k][m] %= MOD;
                }
            }
        }
    }
    ll o = 0;
    for(int i = 0 ; i <= l ; i++) o += dp[n][1][i][2];
    cout << o % MOD;
}

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 856 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 604 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 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 604 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 856 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 600 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 604 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 2396 KB Output is correct
22 Correct 31 ms 35924 KB Output is correct
23 Correct 41 ms 47440 KB Output is correct
24 Correct 38 ms 46936 KB Output is correct
25 Correct 43 ms 50512 KB Output is correct
26 Correct 38 ms 46136 KB Output is correct
27 Correct 19 ms 23644 KB Output is correct
28 Correct 20 ms 26972 KB Output is correct
29 Correct 33 ms 41300 KB Output is correct
30 Correct 43 ms 50772 KB Output is correct