csp 2022.9

最新推荐文章于 2024-07-17 23:24:38 发布

里尔克的小荷

最新推荐文章于 2024-07-17 23:24:38 发布

阅读量128

点赞数

文章标签：深度优先算法

本文链接：https://blog.csdn.net/weixin_50724480/article/details/128001105

版权

编码动态规划 DFS 包邮策略离散化

关键词由CSDN通过智能技术生成

202209-1 如此编码

解答：

n,m = map(int,input().split())
A = list(map(int,input().split()))
C = [0]*(n+1)
C[0] = 1
for i in range(1,n+1):
    C[i] = C[i-1] * A[i-1]
B = [0]*(n+1)
m_mod_c = [(m % C[i]) for i in range(n+1)]
for i in range(1,n+1):
    B[i] =(m_mod_c[i] - m_mod_c[i-1]) // C[i-1]
B.pop(0)
B = [str(x) for x in B]
print(" ".join(B))

202209-2 何以包邮？

解答：70分

n,x = map(int,input().split())
list_book = [0]*n
for i in range(n):
    list_book[i] = int(input())
list_book.insert(0,0)
min_cost = 1e9

def dfs(k,sum):
    global min_cost
    if sum >= x:
        min_cost = min(sum,min_cost)
    if k > n:
        return
    dfs(k+1,sum + list_book[k])
    dfs(k+1,sum)

dfs(1,0)
print(min_cost)

100分

n,x = map(int,input().split())
list_book = [0]*n
for i in range(n):
    list_book[i] = int(input())

M = 3*(10**5)+1
price = [0]*M
price[0] = 1

for i in range(n):
    for j in range(M,list_book[i]-1,-1):
        if price[j - list_book[i]] == 1:
            price[j] = 1


# print(price)
out = x
while 1:
    if price[out] == 1:
        break
    else:
        out += 1
print(out)

参考：

CCF- CSP 202209-2 何以包邮？两种方法 dfs+离散化满分题解_只须一笑不须愁X的博客-CSDN博客