제출 #852813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
852813		iamjiamingliu	A Huge Tower (CEOI10_tower)	Cpython 3	20 / 100	1075 ms	262144 KiB

tower

import sys

_, diff = map(int, input().split())
nums = list(map(int, sys.stdin.readline().strip().split()))

dp = [[0] * len(nums) for _ in range(1 << len(nums))]
for i in range(len(nums)):
    dp[1 << i][i] = 1

for subset in range(1 << len(nums)):
    for last in range(len(nums)):
        if (1 << last) & subset:
            for prev_last in range(len(nums)):
                if (1 << prev_last) & subset and nums[last] <= nums[prev_last] + diff:
                    dp[subset][last] += dp[subset ^ (1 << last)][prev_last]

print(sum(dp[-1]))

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5