oj.uz

Submission #1026561

# Submission time Handle Problem Language Result Execution time Memory
1026561 2024-07-18T07:58:17 Z hqminhuwu Skyscraper (JOI16_skyscraper) C++14
100 / 100
 447 ms 178008 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll,ll> pll;
typedef pair <ll,ll> pii;
typedef pair <ll,pii> piii;

#define forr(_a,_b,_c) for(ll _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(ll _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(ll _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

template<class X, class Y>
    bool minz(X &x, const Y &y) {
        if (x > y) {
            x = y;
            return true;
        } return false;
    }
template<class X, class Y>
    bool maxz(X &x, const Y &y) {
        if (x < y) {
            x = y;
            return true;
        } return false;
    }

const ll N = 5e5 + 5;
const ll oo = (ll) 1e16;
const ll mod = 1e9 + 7; // 998244353;

ll n, l, a[N], dp[105][105][1005][4];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef hqm
        freopen(file".inp", "r", stdin); freopen(file".out", "w", stdout);
    #endif

    cin >> n >> l;

    forr (i, 1, n){
        cin >> a[i];
    }

    if (n == 1){
        cout << 1;
        return 0;
    }
    
    sort(a + 1, a + 1 + n);

    dp[1][0][0][0] = 1;
    ll res = 0;

    forr (i, 1, n){
        forr (j, 0, n){
            forr (k, 0, l){
                forr (t, 0, 2){
                    //if (j == 0 && t != 0) continue;
                    if (dp[i][j][k][t]){
                       // cout << i << " " << j << " " << k << " " << t << " " << dp[i][j][k][t] << "\n";
                    }
                    ll nk;
                    nk = min(l + 1, k + ((j + 1) * 2 - t) * (a[i + 1] - a[i]));
                    (dp[i + 1][j + 1][nk][t] += dp[i][j][k][t] * (j + 1 - t)) %= mod;
                    nk = min(l + 1, k + ((j + 1) * 2 - (t + 1)) * (a[i + 1] - a[i]));
                    (dp[i + 1][j + 1][nk][t + 1] += dp[i][j][k][t] * (2 - t)) %= mod;
                    if (j >= 1){
                        nk = min(l + 1, k + (j * 2 - t) * (a[i + 1] - a[i]));
                        (dp[i + 1][j][nk][t] += dp[i][j][k][t] * (2 * j - t)) %= mod;
                        nk = min(l + 1, k + (j * 2 - (t + 1)) * (a[i + 1] - a[i]));
                        (dp[i + 1][j][nk][t + 1] += dp[i][j][k][t] * (2 - t)) %= mod;
                    }
                    if (j - t >= 2){
                        nk = min (l + 1, k + ((j - 1) * 2 - t) * (a[i + 1] - a[i]));
                        (dp[i + 1][j - 1][nk][t] += dp[i][j][k][t] * (j - t - 1)) %= mod;
                    }
                    if (t && j > t){
                        nk = min(l + 1, k + ((j - 1) * 2 - t) * (a[i + 1] - a[i]));
                        (dp[i + 1][j - 1][nk][t] += dp[i][j][k][t] * t) %= mod;
                    }
                    if (t == 2 && j == 2 && i == n){
                        (res += dp[i][j][k][t]) %= mod;
                    }
                    if (t == 1 && j == 1 && i == n){
                        (res += dp[i][j][k][t]) %= mod;
                    }
                }
            }
        }
    }


    cout << res % mod;

    return 0;
}
/*



*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 4 ms 5724 KB Output is correct
6 Correct 4 ms 5840 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 4 ms 5784 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 4 ms 5724 KB Output is correct
6 Correct 4 ms 5840 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 4 ms 5784 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5468 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 2 ms 5464 KB Output is correct
14 Correct 3 ms 5724 KB Output is correct
15 Correct 2 ms 5724 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 1 ms 5468 KB Output is correct
18 Correct 1 ms 5468 KB Output is correct
19 Correct 2 ms 5724 KB Output is correct
20 Correct 2 ms 5724 KB Output is correct
21 Correct 6 ms 12124 KB Output is correct
22 Correct 265 ms 168956 KB Output is correct
23 Correct 447 ms 173652 KB Output is correct
24 Correct 369 ms 166484 KB Output is correct
25 Correct 411 ms 178008 KB Output is correct
26 Correct 375 ms 161876 KB Output is correct
27 Correct 131 ms 92760 KB Output is correct
28 Correct 170 ms 110420 KB Output is correct
29 Correct 313 ms 168276 KB Output is correct
30 Correct 430 ms 176692 KB Output is correct