oj.uz

Submission #319681

# Submission time Handle Problem Language Result Execution time Memory
319681 2020-11-06T06:38:38 Z qpwoeirut Skyscraper (JOI16_skyscraper) C++17
15 / 100
 191 ms 91136 KB 
#include <bits/stdc++.h>

using namespace std;

const int MN = 14;
const int MX = 101;
const int MOD = 1e9 + 7;

int N, L;
int A[MN];

int dp[1 << MN][MN][MX];

void add(int& a, const int b) {
    a += b;
    if (a >= MOD) a -= MOD;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> N >> L;
    for (int i=0; i<N; ++i) {
        cin >> A[i];
        dp[1 << i][i][0] = 1;
    }
    //sort(A, A+N);

    int ans = 0;
    //do {
    //    int cur = 0;
    //    for (int i=1; i<N; ++i) {
    //        cur += abs(A[i] - A[i-1]);
    //    }
    //    if (cur <= L) ++ans;
    //} while (next_permutation(A, A+N));
    //cout << ans << endl;
    //return 0;

    for (int i=1; i<(1<<N); ++i) {
        for (int j=0; j<N; ++j) {
            if (((i >> j) & 1) == 0) continue;
            for (int k=0; k<N; ++k) {
                if (i & (1 << k)) continue;
                for (int l=0; l<=L; ++l) {
                    int diff = l - abs(A[j] - A[k]);
                    if (diff < 0) continue;
                    add(dp[i + (1 << k)][k][l], dp[i][j][diff]);
                }
            }
        }
    }

    int mask = (1 << N) - 1;
    for (int i=0; i<N; ++i) {
        for (int j=0; j<=L; ++j) {
            add(ans, dp[mask][i][j]);
        }
    }

    cout << ans << endl;
}
/*
4 10
3 6 2 9

8 35
3 7 1 5 10 2 11 6
*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Incorrect 6 ms 1772 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 23012 KB Output is correct
2 Correct 187 ms 90972 KB Output is correct
3 Correct 141 ms 90980 KB Output is correct
4 Correct 186 ms 90980 KB Output is correct
5 Correct 191 ms 91136 KB Output is correct
6 Correct 183 ms 90980 KB Output is correct
7 Correct 121 ms 90928 KB Output is correct
8 Correct 137 ms 90984 KB Output is correct
9 Correct 166 ms 91108 KB Output is correct
10 Correct 174 ms 91108 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Incorrect 6 ms 1772 KB Output isn't correct
6 Halted 0 ms 0 KB -