제출 #876813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
876813		vjudge1	Skyscraper (JOI16_skyscraper)	C++17	5 / 100	940 ms	210772 KiB

skyscraper

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int n, L;
vector<int> v;
vector<vector<vector<ll> > > dp;

ll f(int mask, int last, int total) {
    if(total > L) return 0;
    if(__builtin_popcount(mask) == n) return 1;
    if(dp[mask][last][total] != -1) return dp[mask][last][total];

    ll ans = 0;
    for(int i=0; i<n; i++) {
        if(mask & (1 << i)) continue;
        int newTotal = total + (last == n ? 0 : abs(v[i] - v[last]));
        ans += f(mask | (1 << i), i, newTotal);
    }

    return dp[mask][last][total] = ans;
}

int32_t main() {
    setIO();

    cin >> n >> L;
    v.resize(n);
    for(int &x : v) cin >> x;

    if(n <= 8)
        dp.resize(1<<n, vector<vector<ll> >(n+1, vector<ll>(1005, -1)));
    else if(n > 8 && n <= 14)
        dp.resize(1<<n, vector<vector<ll> >(n+1, vector<ll>(105, -1)));

    cout << f(0, n, 0) << '\n';
    return 0;
}

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