A14 - Four Boxes

提出

TLE

code: python

n, k = map(int, input().split())

a = list(map(int, input().split()))

b = list(map(int, input().split()))

c = list(map(int, input().split()))

d = list(map(int, input().split()))

# O(pow(1000, 4))

ab = []

cd = []

for va in a:

for vb in b:

ab.append(va + vb)

for vc in c:

for vd in d:

cd.append(vc + vd)

for vab in ab:

for vcd in cd:

if vab + vcd == k:

print("Yes")

exit()

print("No")

解答

code: python

import bisect

n, k = map(int, input().split())

a = list(map(int, input().split()))

b = list(map(int, input().split()))

c = list(map(int, input().split()))

d = list(map(int, input().split()))

# O(pow(1000, 4))

ab = []

cd = []

for va in a:

for vb in b:

ab.append(va + vb)

for vc in c:

for vd in d:

cd.append(vc + vd)

cd.sort()

for i in range(len(ab)):

print("Yes")

exit(0)

print("No")

提出

code: python

n, k = map(int, input().split())

a = list(map(int, input().split()))

b = list(map(int, input().split()))

c = list(map(int, input().split()))

d = list(map(int, input().split()))

# O(pow(1000, 2))

sumab = []

for i in range(n):

for j in range(n):

sumcd = set()

for i in range(n):

for j in range(n):

# print(sumab)

# print(sumcd)

# pow(pow(1000, 2), 2) TLE

for i in range(n*n):

print("Yes")

exit()

print("No")