oj.uz

Submission #534917

# Submission time Handle Problem Language Result Execution time Memory
534917 2022-03-09T06:50:43 Z christinelynn A Huge Tower (CEOI10_tower) C++17
40 / 100
 1000 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 21, M = 1e9 + 9;
int a[N], n, d, dp[N][(1<<N)];

ll rek(int pos, int msk){
  if(dp[pos][msk] != -1) return dp[pos][msk];
  if(__builtin_popcount(msk) == n-1){
    for(int i=0;i<n;i++)
    {
      if(msk & (1 << i)) continue;
      return dp[pos][msk] = a[i] <= a[pos] + d;
    }
  }
  ll ret = 0;
  for(int i=0;i<n;i++){
    if(msk & (1 << i)) continue;
    if(a[i] <= a[pos] + d)
      ret = (ret + rek(i, msk | (1 << i))) % M;
  }
  return dp[pos][msk] = ret;
}

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

  memset(dp, -1, sizeof dp);
  cin >> n >> d;
  for(int i=0;i<n;i++) cin >> a[i];
  sort(a, a+n);
  ll ans = 0;
  for(int i=0;i<n;i++)
    ans = (ans + rek(i, (1<<i))) % M;
  cout << ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 172604 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 172616 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 172636 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 172616 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 172612 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 172560 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1045 ms 172716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 172612 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 172664 KB Output is correct

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 579 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 499 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 261 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 264 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 271 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 273 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 260 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 289 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 280 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 261 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 260 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -