# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549512 | theshadow_04 | Skyscraper (JOI16_skyscraper) | C++14 | 258 ms | 101340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// annotshy
#include <bits/stdc++.h>
#define Task "CF"
#define MOD 1000000007
using namespace std;
const int maxn = 200005;
int n, l;
int a[maxn];
int dp[(1 << 14) + 5][15][105];
void Solve(int Test) {
cin >> n >> l;
for(int i = 0; i < n; ++ i) cin >> a[i];
memset(dp, 0, sizeof dp);
for(int i = 0; i < n; ++ i) {
dp[(1 << i)][i][0] = 1;
}
for(int mask = 0; mask < (1 << n); ++ mask) {
for(int last = 0; last < n; ++ last) {
for(int s = 0; s <= l; ++ s) {
if(dp[mask][last][s] == 0 || !(mask >> last & 1)) continue;
for(int nex = 0; nex < n; ++ nex) {
if(mask >> nex & 1) continue;
(dp[mask + (1 << nex)][nex][s + abs(a[last] - a[nex])] += dp[mask][last][s]) %= MOD;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |