CPS-稀疏向量

---

稀疏向量

用python用了几种方法都只有60分，原因是超时，可能是python本身慢的原因，网上有用C做满分的

代码

n, us, vs = map(int, input().split())
u1 = []
u2 = []
out = 0
for i in range(us + vs):
    inp = map(int, input().split())
    a, b = inp
    if i + 1 <= us:
        u1.append(a)
        u2.append(b)
    else:
        if a in u1:
            out += u2[u1.index(a)]*b

print(out)

n, us, vs = map(int, input().split())
u = list(0 for m in range(n))
v = u.copy()
for i in range(us + vs):
    inp = list(map(int, input().split()))
    if i + 1 <= us:
        u[inp[0]-1] = inp[1]
    else:
        v[inp[0]-1] = inp[1]

out = 0
for i in range(n):
    out += u[i]*v[i]

out = sum(a*b for a, b in zip(u, v))
print(out)

新知识

u = [x,x,x]
v = [x,x,x]
out = sum(a*b for a, b in zip(u,v))

---