oj.uz

Submission #241233

# Submission time Handle Problem Language Result Execution time Memory
241233 2020-06-23T11:41:58 Z AM1648 Skyscraper (JOI16_skyscraper) C++17
100 / 100
 40 ms 16760 KB 
/* be name khoda */

// #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <fstream>
#include <set>
#include <map>
using namespace std;

#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define forirto(i, n, e) for (ll i = (n) - 1; i >= e; --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl

const ll MOD = 1000000007;
const ll INF = 2000000000;
const long long BIG = 1446803456761533460LL;

#define XL (x << 1)
#define XR (XL | 1)
#define MD ((l + r) >> 1)
#define Add(a, b) a = ((a) + (1LL * b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD

// -----------------------------------------------------------------------

const ll maxn = 110;
const ll maxa = 1010;

ll N, L, A[maxn];
ll dp[maxn][maxn][maxa][3];

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    cin >> N >> L;
    fori (i, N) cin >> A[i];
    sort(A, A + N);
    
    if (N == 1) {
        cout << "1\n";
        return 0;
    }

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

    fori (i, N - 1) {
        fori (j, (N + 1) / 2) { 
            fori (k, L + 1) {
                fori (c, 3) {
                    ll v = dp[i][j][k][c];
                    ll kk = k + (j * 2 + c) * (A[i + 1] - A[i]);
                    if (kk > L || v == 0) continue;
                    Add(dp[i + 1][j + 1][kk][c], v * (j + c));
                    Add(dp[i + 1][j - 1][kk][c], v * j);
                    Add(dp[i + 1][j    ][kk][c], v * (j * 2 + c));
                    if (c) {
                        Add(dp[i + 1][j    ][kk][c - 1], v * c);
                        Add(dp[i + 1][j + 1][kk][c - 1], v * c);
                    }
                }
            }
        }
    }

    ll ans = 0;
    fori (k, L + 1) Add(ans, dp[N - 1][0][k][0]);
    cout << ans << '\n';

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 ms 512 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 5 ms 768 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 6 ms 1408 KB Output is correct
22 Correct 40 ms 16760 KB Output is correct
23 Correct 36 ms 7288 KB Output is correct
24 Correct 35 ms 10092 KB Output is correct
25 Correct 39 ms 7928 KB Output is correct
26 Correct 36 ms 7544 KB Output is correct
27 Correct 22 ms 8960 KB Output is correct
28 Correct 24 ms 10496 KB Output is correct
29 Correct 36 ms 13048 KB Output is correct
30 Correct 40 ms 8184 KB Output is correct