题目叙述
问题描述:略
输入格式:略
输出格式:略
样例
样例输入
3 10 5
4 6 8
样例输出
7 9 9
样例输入
10 22 30
14 12 16 6 10 2 8 20 18 4
样例输出
6 6 8 2 4 0 4 12 10 2
满分证明
解题思路
-
涉及3个重点:
(1) 到左端点换方向;
(2)到右端点换方向;
(3) 两点相遇换方向; -
最后,做一个列表加和函数。
举一反三:
直接拷贝数组会导致在修改数值时,原数组也发生改变;如果是嵌套数组拷贝值,需要调用copy包中的deepcopy方法。
满分代码一
def ass(a, b):
sum = [0] * len(a)
for i in range(len(a)):
sum[i] = a[i] + b[i]
return sum
n, lc, t = map(int, input().split())
ll = list(map(int, input().split()))
flag = [1] * n
for _ in range(t):
if lc in ll:
flag[ll.index(lc)] = -flag[ll.index(lc)]
if 0 in ll:
flag[ll.index(0)] = -flag[ll.index(0)]
if len(ll) != len(list(set(ll))):
templ = ll.copy()
qcl=sorted(list(set(ll)))
for i in qcl:
if ll.count(i) == 2:
flag[templ.index(i)] = -flag[templ.index(i)]
templ[templ.index(i)] = -1
flag[templ.index(i)] = -flag[templ.index(i)]
ll = ass(ll, flag)
for i in range(n):
print(ll[i], end=" ")
满分代码一优化
把函数优化到里面
n, lc, t = map(int, input().split())
ll = list(map(int, input().split()))
flag = [1] * n
for _ in range(t):
if lc in ll:
flag[ll.index(lc)] = -flag[ll.index(lc)]
if 0 in ll:
flag[ll.index(0)] = -flag[ll.index(0)]
if len(ll) != len(list(set(ll))):
templ = ll.copy()
qcl = sorted(list(set(ll)))
for i in qcl:
if ll.count(i) == 2:
flag[templ.index(i)] = -flag[templ.index(i)]
templ[templ.index(i)] = -1
flag[templ.index(i)] = -flag[templ.index(i)]
ll = [ll[i]+flag[i] for i in range(len(ll))]
for i in range(n):
print(ll[i], end=" ")
满分代码二
n, l, t = map(int, input().split())
pz = list(map(int, input().split()))
flag = [1] * n
for _ in range(t):
for i in range(n):
if pz[i] == l or pz[i] == 0:
flag[i] = flag[i] * (-1)
pz[i] = pz[i] + flag[i]
temp = pz.copy()
for ind, tpz in enumerate(temp):
if temp.count(tpz) == 2 and tpz != -1:
flag[temp.index(tpz)] = flag[temp.index(tpz)] * (-1)
temp[temp.index(tpz)] = -1
flag[temp.index(tpz)] = flag[temp.index(tpz)] * (-1)
for wpz in pz:
print(wpz, end=" ")
需者自取传送门(∩ᄑ_ᄑ)⊃━☆【CCF 2013-2021】本博主整理历年至少前两题 python 满分代码目录