oj.uz

Submission #549512

# Submission time Handle Problem Language Result Execution time Memory
549512 2022-04-16T01:56:19 Z theshadow_04 Skyscraper (JOI16_skyscraper) C++14
0 / 100
 258 ms 101340 KB 
// 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;
        }
      }
    }
  }
  int ans = 0;
  for(int last = 0; last < n; ++ last) {
    for(int s = 0; s <= l; ++ s) {
      (ans += dp[(1 << n) - 1][last][s]) %= MOD;
    }
  }
  cout << ans << "\n";
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  if(fopen(Task".inp", "r")) {
    freopen(Task".inp", "r", stdin);
    freopen(Task".out", "w", stdout);
  }
  int test = 1;
  // cin >> test;
  for(int i = 1; i <= test; ++ i) {
    Solve(i);
  }
}

/*no pain no gain*/

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(Task".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(Task".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 101280 KB Output is correct
2 Correct 36 ms 101272 KB Output is correct
3 Correct 39 ms 101248 KB Output is correct
4 Incorrect 38 ms 101324 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 101284 KB Output is correct
2 Incorrect 258 ms 101340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 101280 KB Output is correct
2 Correct 36 ms 101272 KB Output is correct
3 Correct 39 ms 101248 KB Output is correct
4 Incorrect 38 ms 101324 KB Output isn't correct
5 Halted 0 ms 0 KB -