oj.uz

Submission #963260

# Submission time Handle Problem Language Result Execution time Memory
963260 2024-04-14T19:40:25 Z BhavayGoyal Skyscraper (JOI16_skyscraper) C++14
15 / 100
 524 ms 207700 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

int n, l;
int arr[16];
int dp[(1<<15)][16][101];

int sol(int mask, int prev, int sum) {
    if (__builtin_popcount(mask) == n) return 1;
    if (dp[mask][prev][sum] != -1) return dp[mask][prev][sum];
    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (mask&(1<<i)) continue;
        int newsum = sum + (prev==n?0:abs(arr[prev]-arr[i]));
        if (newsum <= l) ans = (ans + sol(mask|(1<<i), i, newsum))%MOD;
    }
    return dp[mask][prev][sum] = ans;
}

void sol() {
    memset(dp, -1, sizeof dp);
    cin >> n >> l;
    for (int i = 0; i < n; i++) cin >> arr[i];

    cout << sol(0, n, 0) << endl;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 207440 KB Output is correct
2 Correct 76 ms 207440 KB Output is correct
3 Correct 73 ms 207600 KB Output is correct
4 Correct 67 ms 207620 KB Output is correct
5 Correct 67 ms 207440 KB Output is correct
6 Correct 71 ms 207440 KB Output is correct
7 Correct 72 ms 207604 KB Output is correct
8 Correct 69 ms 207584 KB Output is correct
9 Incorrect 79 ms 207440 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 207492 KB Output is correct
2 Correct 95 ms 207620 KB Output is correct
3 Correct 446 ms 207692 KB Output is correct
4 Correct 92 ms 207472 KB Output is correct
5 Correct 81 ms 207696 KB Output is correct
6 Correct 414 ms 207688 KB Output is correct
7 Correct 86 ms 207440 KB Output is correct
8 Correct 409 ms 207700 KB Output is correct
9 Correct 524 ms 207696 KB Output is correct
10 Correct 103 ms 207684 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 207440 KB Output is correct
2 Correct 76 ms 207440 KB Output is correct
3 Correct 73 ms 207600 KB Output is correct
4 Correct 67 ms 207620 KB Output is correct
5 Correct 67 ms 207440 KB Output is correct
6 Correct 71 ms 207440 KB Output is correct
7 Correct 72 ms 207604 KB Output is correct
8 Correct 69 ms 207584 KB Output is correct
9 Incorrect 79 ms 207440 KB Output isn't correct
10 Halted 0 ms 0 KB -