제출 #584391

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584391		dxz05	Skyscraper (JOI16_skyscraper)	C++14	20 / 100	221 ms	185932 KiB

skyscraper

#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

#include <random>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e6 + 3e2;
const int M = 1111;

long long skyscraper_combinations(int n, int l, vector<int> a){
    vector<vector<vector<ll>>> dp(1 << n, vector<vector<ll>>(n, vector<ll>(l + 1, 0)));
    for (int i = 0; i < n; i++) dp[1 << i][i][0] = 1;

    for (int mask = 0; mask < (1 << n); mask++){
        for (int i = 0; i < n; i++){
            if (!(mask & (1 << i))) continue;

            for (int j = 0; j < n; j++){
                if (mask & (1 << j)) continue;

                int diff = abs(a[i] - a[j]);
                for (int k = 0; k + diff <= l; k++){
                    (dp[mask | (1 << j)][j][k + diff] += dp[mask][i][k]) %= MOD;
                }

            }

        }
    }

    ll ans = 0;
    for (int i = 0; i < n; i++){
        ans += accumulate(all(dp[(1 << n) - 1][i]), 0ll);
        ans %= MOD;
    }

    return ans;
}

void solve(int TC) {
    int n, l;
    cin >> n >> l;
    vector<int> a(n);
    for (int &i : a) cin >> i;

    cout << skyscraper_combinations(n, l, a) << endl;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 0 / 80