input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
import sys
from pprint import pprint
bingo = [[] for _ in range(3)]
for i in range(3):
bingo[i] = list(map(int, sys.stdin.readline().strip().split()))
N = int(sys.stdin.readline().strip())
B = set()
for _ in range(N):
B.add(int(sys.stdin.readline().strip()))
bingo_flag = False
for i in range(3):
tmp = []
for j in range(3):
if bingo[i][j] not in B:
break
else:
bingo_flag = True
for i in range(3):
for j in range(3):
if bingo[j][i] not in B:
break
else:
bingo_flag = True
for i in range(3):
if bingo[i][i] not in B:
break
else:
bingo_flag = True
for i in range(3):
if bingo[2-i][i] not in B:
break
else:
bingo_flag = True
if bingo_flag:
print("Yes")
else:
print("No")
|
import sys
input = sys.stdin.readline
bingo = []
for _ in range(3):
bingo.append(list(map(int, input().split())))
N = int(eval(input()))
nums = []
for _ in range(N):
nums.append(int(eval(input())))
for num in nums:
for i in range(3):
for j in range(3):
if bingo[i][j] == num:
bingo[i][j] = -1
for i in range(3):
if sum(bingo[i]) == -3:
print("Yes")
sys.exit()
tmp = 0
for j in range(3):
tmp += bingo[j][i]
if tmp == -3:
print("Yes")
sys.exit()
if bingo[0][0] == -1 and bingo[1][1] == -1 and bingo[2][2] == -1:
print("Yes")
sys.exit()
if bingo[0][2] == -1 and bingo[1][1] == -1 and bingo[0][2] == -1:
print("Yes")
sys.exit()
print("No")
|
p02760
|
def main():
top = list(map(int, input().split()))
middle = list(map(int, input().split()))
bottom = list(map(int, input().split()))
N = int(eval(input()))
taken = []
for f in range(N):
taken.append(int(eval(input())))
bingo = []
bingo.append(top)
bingo.append(middle)
bingo.append(bottom)
temp = [top[0], middle[0], bottom[0]]
bingo.append(temp)
temp = [top[1], middle[1], bottom[1]]
bingo.append(temp)
temp = [top[2], middle[2], bottom[2]]
bingo.append(temp)
temp = [top[0], middle[1], bottom[2]]
bingo.append(temp)
temp = [top[2], middle[1], bottom[0]]
bingo.append(temp)
if bingo[0][0] in taken and bingo[0][1] in taken and bingo[0][2] in taken:
print('Yes')
elif bingo[1][0] in taken and bingo[1][1] in taken and bingo[1][2] in taken:
print('Yes')
elif bingo[2][0] in taken and bingo[2][1] in taken and bingo[2][2] in taken:
print('Yes')
elif bingo[3][0] in taken and bingo[3][1] in taken and bingo[3][2] in taken:
print('Yes')
elif bingo[4][0] in taken and bingo[4][1] in taken and bingo[4][2] in taken:
print('Yes')
elif bingo[5][0] in taken and bingo[5][1] in taken and bingo[5][2] in taken:
print('Yes')
elif bingo[6][0] in taken and bingo[6][1] in taken and bingo[6][2] in taken:
print('Yes')
elif bingo[7][0] in taken and bingo[7][1] in taken and bingo[7][2] in taken:
print('Yes')
else:
print('No')
main()
|
def main():
top = list(map(int, input().split()))
middle = list(map(int, input().split()))
bottom = list(map(int, input().split()))
N = int(eval(input()))
taken = []
for i in range(N):
taken.append(int(eval(input())))
bingo = []
bingo.append(top)
bingo.append(middle)
bingo.append(bottom)
temp = [top[0], middle[0], bottom[0]]
bingo.append(temp)
temp = [top[1], middle[1], bottom[1]]
bingo.append(temp)
temp = [top[2], middle[2], bottom[2]]
bingo.append(temp)
temp = [top[0], middle[1], bottom[2]]
bingo.append(temp)
temp = [top[2], middle[1], bottom[0]]
bingo.append(temp)
cnt = 0
flag = 0
for i in range(len(bingo)):
cnt = 0
for j in range(len(bingo[i])):
if bingo[i][j] in taken:
cnt += 1
if cnt == 3:
flag += 1
if flag > 0:
print('Yes')
else:
print('No')
main()
|
p02760
|
A = []
for i in range(3):
A.append(list(map(int, input().split())))
N = int(eval(input()))
b = []
for i in range(N):
b.append(int(eval(input())))
for i in range(3):
if A[i][0] in b and A[i][1] in b and A[i][2] in b:
print('Yes')
exit()
for i in range(3):
if A[0][i] in b and A[1][i] in b and A[2][i] in b:
print('Yes')
exit()
if A[0][0] in b and A[1][1] in b and A[2][2] in b:
print('Yes')
exit()
if A[2][0] in b and A[1][1] in b and A[0][2] in b:
print('Yes')
exit()
print('No')
|
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(eval(input()))
a = []
ans = 0
for i in range(n):
b = int(eval(input()))
a.append(b)
for i in range(3):
if a1[i] in a and a2[i] in a and a3[i] in a:
ans = 'Yes'
if a1[0] in a and a1[1] in a and a1[2] in a:
ans = 'Yes'
if a2[0] in a and a2[1] in a and a3[2] in a:
ans = 'Yes'
if a3[0] in a and a3[1] in a and a3[2] in a:
ans = 'Yes'
if a1[0] in a and a2[1] in a and a3[2] in a:
ans = 'Yes'
if a1[2] in a and a2[1] in a and a3[0] in a:
ans = 'Yes'
if ans == 'Yes':
print(ans)
else:
print('No')
|
p02760
|
A = sum([list(map(int, input().split())) for _ in range(3)], [])
N = int(eval(input()))
ans = 0
for _ in range(N):
b = int(eval(input()))
if b in A:
A[A.index(b)] = 0
if (
A[0] + A[1] + A[2] == 0
or A[3] + A[4] + A[5] == 0
or A[6] + A[7] + A[8] == 0
or A[0] + A[3] + A[6] == 0
or A[1] + A[4] + A[7] == 0
or A[2] + A[5] + A[8] == 0
or A[0] + A[4] + A[8] == 0
or A[2] + A[4] + A[6] == 0
):
print("Yes")
break
else:
print("No")
|
A = sum([list(map(int, input().split())) for _ in range(3)], [])
N = int(eval(input()))
for _ in range(N):
b = int(eval(input()))
if b in A:
A[A.index(b)] = 0
if (
A[0] + A[1] + A[2] == 0
or A[3] + A[4] + A[5] == 0
or A[6] + A[7] + A[8] == 0
or A[0] + A[3] + A[6] == 0
or A[1] + A[4] + A[7] == 0
or A[2] + A[5] + A[8] == 0
or A[0] + A[4] + A[8] == 0
or A[2] + A[4] + A[6] == 0
):
print("Yes")
break
else:
print("No")
|
p02760
|
A=[]
for _ in range(3):
A+=list(map(int,input().split()))
N=int(eval(input()))
for _ in range(N):
b=int(eval(input()))
if b in A:
A[A.index(b)]=0
p=[
(0,1,2),(3,4,5),(6,7,8),
(0,3,6),(1,4,7),(2,5,8),
(0,4,8),(2,4,6),
]
for i,j,k in p:
if A[i]==A[j]==A[k]==0:
print('Yes')
break
else:
print('No')
|
A=[]
for _ in range(3):
A+=list(map(int,input().split()))
N=int(eval(input()))
for _ in range(N):
b=int(eval(input()))
if b in A:
A[A.index(b)]=0
p=[
(0,1,2),(3,4,5),(6,7,8),
(0,3,6),(1,4,7),(2,5,8),
(0,4,8),(2,4,6),
]
for i,j,k in p:
if A[i]==A[j]==A[k]:
print('Yes')
break
else:
print('No')
|
p02760
|
def f():
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
A = a1+a2+a3
N = int(eval(input()))
c = [False]*9
for i in range(N):
b = int(eval(input()))
if b in A:
c[A.index(b)] = True
for i in range(3):
if c[i] and c[3+i] and c[6+i]:
return 'Yes'
elif c[3*i] and c[3*i+1] and c[3*i+2]:
return 'Yes'
if c[0] and c[4] and c[8]:
return 'Yes'
elif c[2] and c[4] and c[6]:
return 'Yes'
return 'No'
print((f()))
|
*A, = list(map(int, open(0).read().split()))
N = A[9]
B = A[10:]
A = A[:9]
T = [False]*9
for b in B:
if b in A:
T[A.index(b)] = True
bingo = [(0, 1, 2), (3, 4, 5), (6, 7, 8), (0, 3, 6),
(1, 4, 7), (2, 5, 8), (0, 4, 8), (2, 4, 6)]
for a, b, c in bingo:
if T[a] and T[b] and T[c]:
print('Yes')
break
else:
print('No')
|
p02760
|
a = [list(map(int, input().split())) for _ in range(3)]
n = int(eval(input()))
b = [int(eval(input())) for _ in range(n)]
mark = [[False, False, False] for _ in range(3)]
for i in range(3):
for j in range(3):
if a[i][j] in b:mark[i][j] = True
ans = 'No'
for i in range(3):
if mark[i][0] and mark[i][1] and mark[i][2]:
ans = 'Yes'
break
for j in range(3):
if mark[0][j] and mark[1][j] and mark[2][j]:
ans = 'Yes'
break
if (mark[0][0] and mark[1][1] and mark[2][2]) or (mark[0][2] and mark[1][1] and mark[2][0]): ans = 'Yes'
print(ans)
|
a = [list(map(int, input().split())) for _ in range(3)]
n = int(eval(input()))
b = [int(eval(input())) for _ in range(n)]
mark = [[False, False, False] for _ in range(3)]
for i in range(3):
for j in range(3):
if a[i][j] in b:mark[i][j] = True
ans = 'No'
for i in range(3):
if all(mark[i]):
ans = 'Yes'
break
for j in range(3):
if mark[0][j] and mark[1][j] and mark[2][j]:
ans = 'Yes'
break
if (mark[0][0] and mark[1][1] and mark[2][2]) or (mark[0][2] and mark[1][1] and mark[2][0]): ans = 'Yes'
print(ans)
|
p02760
|
A = [list(map(int, input().split())) for _ in range(3)]
N = int(eval(input()))
b = [int(eval(input())) for _ in range(N)]
field = 0
for v in b:
for i in range(9):
if A[i // 3][i % 3] == v:
field = field | (1 << i)
ans = False
for v in sum([[273,84],sum([[73<<i,7<<i*3]for i in range(3)],[])],[]):
ans = ans or field&v==v;
print(('Yes' if ans else 'No'))
|
A = [list(map(int, input().split())) for _ in range(3)]
N = int(eval(input()))
b = [int(eval(input())) for _ in range(N)]
f=0
for v in b:
for i in range(9):
if A[i // 3][i % 3] == v:
f|=1<<i
ans = 0
for v in [7,56,73,84,146,273,292,448]:
ans |= f&v==v;
print(('Yes' if ans else 'No'))
|
p02760
|
p,r=input,range
A=sum([list(map(int,p().split()))for _ in r(3)],[])
b=[int(p())for _ in r(int(p()))]
print(('Yes'if[v for v in[7,56,73,84,146,273,292,448]if sum(1<<i for i in r(9)if A[i]in b)&v==v]else'No'))
|
p,r=input,range
A=sum([list(map(int,p().split()))for _ in r(3)],[])
b=[int(p())for _ in r(int(p()))]
print(('YNeos'[all([sum(1<<i for i in r(9)if A[i]in b)&v!=v for v in[7,56,73,84,146,273,292,448]])::2]))
|
p02760
|
A = [list(map(int,input().split())) for i in range(3)]
N = int(eval(input()))
b = [int(eval(input())) for i in range(N)]
cnt = [0]*8
ans = "No"
for i in range(3):
for j in range(3):
if A[i][j] in b:
cnt[i] += 1
cnt[j+3] += 1
if i== j:
cnt[-2] += 1
if i+j == 2:
cnt[-1] += 1
for k in range(8):
if cnt[k] >= 3:
ans = "Yes"
break
print(ans)
|
A = [list(map(int,input().split())) for i in range(3)]
N = int(eval(input()))
b = [int(eval(input())) for i in range(N)]
cnt = [0]*8
ans = "No"
for i in range(3):
for j in range(3):
if A[i][j] in b:
cnt[i] += 1
cnt[j+3] += 1
if i == j:
cnt[-1] += 1
if i+j == 2:
cnt[-2] += 1
for k in range(8):
if cnt[k] >= 3:
ans = "Yes"
break
print(ans)
|
p02760
|
from collections import defaultdict
def a():
A = []
A += list(map(int,input().split()))
A += list(map(int,input().split()))
A += list(map(int,input().split()))
N = int(eval(input()))
d = defaultdict(int)
for _ in range(N):
d[int(eval(input()))] = 1
B = list([d[x] for x in A])
if sum(B[::4]) == 3:
return 1
if sum(B[2:8:2]) == 3:
return 1
for i in range(3):
if sum(B[i*3:i*3+3]) == 3:
return 1
if sum(B[i::3]) == 3:
return 1
return 0
print((["No","Yes"][a()]))
|
(lambda A:(lambda N:(lambda
C:(lambda d:(lambda B:print
(["No","Yes"][3 in{sum(B[2:
8:2]),sum(B[::4])}|{sum(B[i
*3:i*3+3])for i in range(3)
} | { sum(B[i::3] )for i in
range(3)} ] ) ) ( list(map(
lambda x:d[x],A))))([x in C
for x in range(101)]))({int
(input())for x in range(N)}
))(int(input())))(list(map(
int,input().split()))+list(
map(int,input().split())) +
list(map(int,input().split())))
|
p02760
|
array_1 = []
for i in range(3):
line = input().rstrip().split(' ')
array_1.append(line)
# print(array_1)
bool_array = []
for i in range(3):
tmp = []
for j in range(3):
tmp.append(False)
bool_array.append(tmp)
# print(bool_array)
num = int(input().rstrip())
for i in range(num):
input_line = input().rstrip()
for j in range(3):
for k in range(3):
if array_1[j][k] == input_line:
bool_array[j][k] = True
ans = "No"
for i in range(3):
if bool_array[i][0] and bool_array[i][1] and bool_array[i][2]:
ans = 'Yes'
for i in range(3):
if bool_array[0][i] and bool_array[1][i] and bool_array[2][i]:
ans = 'Yes'
if bool_array[0][0] and bool_array[1][1] and bool_array[2][2]:
ans = 'Yes'
if bool_array[0][2] and bool_array[1][1] and bool_array[2][0]:
ans = 'Yes'
print(ans)
|
array_1 = []
for i in range(3):
line = input().rstrip().split(' ')
array_1.append(line)
bool_array = []
for i in range(3):
tmp = []
for j in range(3):
tmp.append(False)
bool_array.append(tmp)
num = int(input().rstrip())
for i in range(num):
input_line = input().rstrip()
for j in range(3):
for k in range(3):
if array_1[j][k] == input_line:
bool_array[j][k] = True
ans = "No"
for i in range(3):
if bool_array[i][0] and bool_array[i][1] and bool_array[i][2]:
ans = 'Yes'
if bool_array[0][i] and bool_array[1][i] and bool_array[2][i]:
ans = 'Yes'
if bool_array[0][0] and bool_array[1][1] and bool_array[2][2]:
ans = 'Yes'
if bool_array[0][2] and bool_array[1][1] and bool_array[2][0]:
ans = 'Yes'
print(ans)
|
p02760
|
def myAnswer(A:list,B:list,N:int) -> str:
bingo=[[0,0,0] for i in range(3)]
for b in B:
for i,a in enumerate(A):
if(b in a):
bingo[i][a.index(b)] = 1
break
tate=[0,0,0]
for n,b in enumerate(bingo):
if(sum(b) == 3):
return "Yes"
for i in range(3):
tate[i] += b[i]
if(3 in tate): return "Yes"
if(bingo[1][1] == 1):
if((bingo[0][0] == 1 and bingo[2][2] == 1) or (bingo[0][2]==1 and bingo[2][0]==1)):
return "Yes"
return "No"
def modelAnswer():
tmp=1
def main():
A=[]
B=[]
for _ in range(3):
A.append(list(map(int,input().split())))
N = int(eval(input()))
for _ in range(N):
B.append(int(eval(input())))
print((myAnswer(A[:],B[:],N)))
if __name__ == '__main__':
main()
|
def myAnswer(A: list, B: list, N: int) -> str:
bingoCard = [[0, 0, 0] for i in range(3)]
row = [0, 0, 0]
# マスが空くがどうかの判定
for b in B:
for i, a in enumerate(A):
if(b in a):
bingoCard[i][a.index(b)] = 1
row[a.index(b)] += 1
break
for n, b in enumerate(bingoCard):
if(sum(b) == 3):
return "Yes" # 横の判定
# 縦の判定(列ごとの合計が3である列があったかどうか)
if(3 in row):
return "Yes"
# 斜めの判定
if(bingoCard[1][1]):
if((bingoCard[0][0] and bingoCard[2][2]) or (bingoCard[0][2] and bingoCard[2][0])):
return "Yes"
# 縦、横、斜めに当てはまらなければ,No
return "No"
def modelAnswer():
tmp = 1
def main():
A = []
B = []
for _ in range(3):
A.append(list(map(int, input().split())))
N = int(eval(input()))
for _ in range(N):
B.append(int(eval(input())))
print((myAnswer(A[:], B[:], N)))
if __name__ == '__main__':
main()
|
p02760
|
x = list(map(int,input().split()))
y = list(map(int,input().split()))
z = list(map(int,input().split()))
n = int(eval(input()))
b = list(int(eval(input())) for i in range(n))
for i in range(n):
if b[i] in x:
x[x.index(b[i])] = 'T'
if b[i] in y:
y[y.index(b[i])] = 'T'
if b[i] in z:
z[z.index(b[i])] = 'T'
if x[0] == 'T' and x[1] == 'T' and x[2] == 'T':
print('Yes')
elif y[0] == 'T' and y[1] == 'T' and y[2] == 'T':
print('Yes')
elif z[0] == 'T' and z[1] == 'T' and z[2] == 'T':
print('Yes')
elif x[0] == 'T' and y[0] == 'T' and z[0] == 'T':
print('Yes')
elif x[1] == 'T' and y[1] == 'T' and z[1] == 'T':
print('Yes')
elif x[2] == 'T' and y[2] == 'T' and z[2] == 'T':
print('Yes')
elif x[0] == 'T' and y[1] == 'T' and z[2] == 'T':
print('Yes')
elif x[2] == 'T' and y[1] == 'T' and z[0] == 'T':
print('Yes')
else:
print('No')
|
x = list(map(int,input().split()))
y = list(map(int,input().split()))
z = list(map(int,input().split()))
n = int(eval(input()))
for i in range(n):
b = int(eval(input()))
if b in x:
x[x.index(b)] = 'T'
if b in y:
y[y.index(b)] = 'T'
if b in z:
z[z.index(b)] = 'T'
if x[0] == 'T' and x[1] == 'T' and x[2] == 'T':
print('Yes')
elif y[0] == 'T' and y[1] == 'T' and y[2] == 'T':
print('Yes')
elif z[0] == 'T' and z[1] == 'T' and z[2] == 'T':
print('Yes')
elif x[0] == 'T' and y[0] == 'T' and z[0] == 'T':
print('Yes')
elif x[1] == 'T' and y[1] == 'T' and z[1] == 'T':
print('Yes')
elif x[2] == 'T' and y[2] == 'T' and z[2] == 'T':
print('Yes')
elif x[0] == 'T' and y[1] == 'T' and z[2] == 'T':
print('Yes')
elif x[2] == 'T' and y[1] == 'T' and z[0] == 'T':
print('Yes')
else:
print('No')
|
p02760
|
#Biginner Contest 157 B-Bingo
#二次元配列を使う(3*3)
bingonum=[[0,0,0],[0,0,0],[0,0,0]]
bingo=[["False","False","False"],["False","False","False"],["False","False","False"]]
for i in range(3):
bingonum[i][0],bingonum[i][1],bingonum[i][2] = list(map(int,input().split()))
N = int(eval(input()))
b=[]
for _ in range(N):
b.append(int(eval(input())))
for x in range(N):
for i in range(3):
for j in range(3):
if bingonum[i][j]==b[x]:
bingo[i][j]="True"
IsBingo = "No"
for i in range(3):
if bingo[i][0] =="True" and bingo[i][1] =="True" and bingo[i][2] =="True":
IsBingo="Yes"
elif bingo[0][i] =="True" and bingo[1][i] =="True" and bingo[2][i] =="True":
IsBingo="Yes"
if (bingo[0][0] =="True" and bingo[1][1] =="True" and bingo[2][2] =="True") or (bingo[0][2] =="True" and bingo[1][1] =="True" and bingo[2][0]=="True"):
IsBingo="Yes"
print(IsBingo)
|
bingonum=[[0,0,0],[0,0,0],[0,0,0]]
bingo=[["False","False","False"],["False","False","False"],["False","False","False"]]
for i in range(3):
bingonum[i][0],bingonum[i][1],bingonum[i][2] = list(map(int,input().split()))
N = int(eval(input()))
b=[]
for _ in range(N):
b.append(int(eval(input())))
for x in range(N):
for i in range(3):
for j in range(3):
if bingonum[i][j]==b[x]:
bingo[i][j]="True"
IsBingo = "No"
for i in range(3):
if bingo[i][0] =="True" and bingo[i][1] =="True" and bingo[i][2] =="True":
IsBingo="Yes"
if bingo[0][i] =="True" and bingo[1][i] =="True" and bingo[2][i] =="True":
IsBingo="Yes"
if (bingo[0][0] =="True" and bingo[1][1] =="True" and bingo[2][2] =="True") or (bingo[0][2] =="True" and bingo[1][1] =="True" and bingo[2][0]=="True"):
IsBingo="Yes"
print(IsBingo)
|
p02760
|
from collections import defaultdict
def main():
def is_in(a, b):
return (a, b) in nums_points
flag = 0
row1 = list(map(int, input().split()))
row2 = list(map(int, input().split()))
row3 = list(map(int, input().split()))
n = int(eval(input()))
nums = [int(eval(input())) for i in range(n)]
mat = [row1, row2, row3]
combs = defaultdict(int)
for i in range(3):
for j in range(3):
combs[mat[i][j]] = (i, j)
nums_points = []
for n in nums:
nums_points.append(combs[n])
if is_in(0, 0) and is_in(0, 1) and is_in(0, 2):
flag += 1
if is_in(1, 0) and is_in(1, 1) and is_in(1, 2):
flag += 1
if is_in(2, 0) and is_in(2, 1) and is_in(2, 2):
flag += 1
if is_in(0, 0) and is_in(1, 0) and is_in(2, 0):
flag += 1
if is_in(0, 1) and is_in(1, 1) and is_in(2, 1):
flag += 1
if is_in(0, 2) and is_in(1, 2) and is_in(2, 2):
flag += 1
if is_in(0, 0) and is_in(1, 1) and is_in(2, 2):
flag += 1
if is_in(0, 2) and is_in(1, 1) and is_in(2, 0):
flag += 1
if flag:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
from collections import defaultdict
def main():
def is_in(a, b):
return (a, b) in nums_points
flag = 0
mat = [
list(map(int, input().split())),
list(map(int, input().split())),
list(map(int, input().split()))
]
n = int(eval(input()))
nums = [int(eval(input())) for i in range(n)]
combs = defaultdict(int)
for i in range(3):
for j in range(3):
combs[mat[i][j]] = (i, j)
nums_points = []
for n in nums:
nums_points.append(combs[n])
if is_in(0, 0) and is_in(0, 1) and is_in(0, 2):
flag += 1
if is_in(1, 0) and is_in(1, 1) and is_in(1, 2):
flag += 1
if is_in(2, 0) and is_in(2, 1) and is_in(2, 2):
flag += 1
if is_in(0, 0) and is_in(1, 0) and is_in(2, 0):
flag += 1
if is_in(0, 1) and is_in(1, 1) and is_in(2, 1):
flag += 1
if is_in(0, 2) and is_in(1, 2) and is_in(2, 2):
flag += 1
if is_in(0, 0) and is_in(1, 1) and is_in(2, 2):
flag += 1
if is_in(0, 2) and is_in(1, 1) and is_in(2, 0):
flag += 1
if flag:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
p02760
|
A = [list(map(int, input().split())) for i in range(3)]
N = int(eval(input()))
m = [[0]*3 for i in range(3)]
ans,l,r = 0,0,0
for _ in range(N):
b = int(eval(input()))
for i in range(3):
if b in A[i]:
m[i][A[i].index(b)]=1
for i in range(3):
t = sum(m[i])
l += m[i][i]
y = 0
for j in range(3):
y += m[j][i]
if i+j == 2:
r += m[i][j]
if t==3 or y==3 or r==3 or l==3:
ans=1
print(('Yes' if ans else 'No'))
|
A = [list(map(int, input().split())) for i in range(3)]
N = int(eval(input()))
m = [[0]*3 for i in range(3)]
ans,l,r = 0,1,1
for _ in range(N):
b = int(eval(input()))
for i in range(3):
if b in A[i]:
m[i][A[i].index(b)]=1
for i in range(3):
l *= m[i][i]
t,y = 1,1
for j in range(3):
y *= m[j][i]
t *= m[i][j]
if i+j == 2:
r *= m[i][j]
if t or y:
ans=1
print(('Yes' if ans or l or r else 'No'))
|
p02760
|
bingo = [list(map(int, input().split())) for i in range(3)]
n = int(eval(input()))
nums = [int(eval(input())) for i in range(n)]
res = 'No'
for num in nums:
for i in range(3):
if num in bingo[i]:
j = bingo[i].index(num)
bingo[i][j] = 0
if sum(bingo[i]) == 0 or sum([row[j] for row in bingo]) == 0:
res = 'Yes'
elif (i + j) % 2 == 0:
if i + j == 2 and sum([bingo[0][2], bingo[1][1], bingo[2][0]]) == 0:
res = 'Yes'
elif i == j and sum([bingo[0][0], bingo[1][1], bingo[2][2]]) == 0:
res = 'Yes'
break
if res == 'Yes':
break
print(res)
|
bingo = [list(map(int, input().split())) for i in range(3)]
n = int(eval(input()))
for i in range(n):
num = int(eval(input()))
for j in range(3):
for k in range(3):
if bingo[j][k] == num:
bingo[j][k] = 0
break;
res = 'No'
for i in range(3):
if bingo[i][0] == bingo[i][1] == bingo[i][2] == 0:
res = 'Yes'
break
elif bingo[0][i] == bingo[1][i] == bingo[2][i] == 0:
res = 'Yes'
break
if bingo[0][2] == bingo[1][1] == bingo[2][0] == 0:
res = 'Yes'
elif bingo[0][0] == bingo[1][1] == bingo[2][2] == 0:
res = 'Yes'
print(res)
|
p02760
|
b1 = [int(x) for x in input().split()]
b2 = [int(x) for x in input().split()]
b3 = [int(x) for x in input().split()]
n = int(eval(input()))
li = list()
for i in range(n):
li.append(int(eval(input())))
b1_0 = False
b1_1 = False
b1_2 = False
b2_0 = False
b2_1 = False
b2_2 = False
b3_0 = False
b3_1 = False
b3_2 = False
for name in li:
for j ,name2 in enumerate(b1):
if(name2 == name):
if(j == 0):
b1_0 = True
elif(j == 1):
b1_1 = True
else:
b1_2 = True
for k,name3 in enumerate(b2):
if(name == name3):
if(k == 0):
b2_0 = True
elif(k == 1):
b2_1 = True
else:
b2_2 = True
for l,name4 in enumerate(b3):
if(name == name4):
if(l == 0):
b3_0 = True
elif(l == 1):
b3_1 = True
else:
b3_2 = True
if (b1_0 and b1_1 and b1_2):
print("Yes")
elif (b2_0 and b2_1 and b2_2):
print("Yes")
elif (b3_0 and b3_1 and b3_2):
print("Yes")
elif (b1_0 and b2_0 and b3_0):
print("Yes")
elif (b1_1 and b2_1 and b3_1):
print("Yes")
elif(b1_2 and b2_2 and b3_2):
print("Yes")
elif (b1_0 and b2_1 and b3_2):
print("Yes")
elif (b1_2 and b2_1 and b3_0):
print("Yes")
else:
print("No")
|
a = list()
for i in range(3):
a.append([int(x) for x in input().split()])
n = int(eval(input()))
b = list()
for i in range(n):
b.append(int(eval(input())))
appear = [[0,0,0],[0,0,0],[0,0,0]]
for i in range(3):
for j in range(3):
for k in b:
if (a[i][j] == k):
appear[i][j] = 1
def x ():
for i in range(3):
if (appear[i][0] and appear[i][1] and appear[i][2] ):
return "Yes"
for i in range(3):
if (appear[0][i] and appear[1][i] and appear[2][i]):
return "Yes"
if (appear[0][0] and appear[1][1] and appear[2][2]):
return "Yes"
if (appear[0][2] and appear[1][1] and appear[2][0]):
return "Yes"
return "No"
print((x()))
|
p02760
|
import sys
Field = []
for i in range(3):
a, b, c = list(map(int, input().split(" ")))
local = [a,b,c]
Field.append(local)
N = int(eval(input()))
for i in range(N):
target = int(eval(input()))
for i in Field:
if target in i:
k = i.index(target)
i[k] = -1
else:
pass
if Field[0][0] == -1 and Field[1][1] == -1 and Field[2][2] == -1:
print("Yes")
sys.exit()
if Field[0][2] == -1 and Field[1][1] == -1 and Field[2][0] == -1:
print("Yes")
sys.exit()
for i in range(3):
if Field[0][i] == -1 and Field[1][i] == -1 and Field[2][i] == -1:
print("Yes")
sys.exit()
elif sum(Field[i]) == -3:
print("Yes")
sys.exit()
print("No")
|
Field = [list(map(int, input().split(" "))) for i in range(3)]
N = int(eval(input()))
num =[]
for i in range(N):
t = int(eval(input()))
num.append(t)
count=0
for i in Field:
for t in range(3):
if i[t] in num:
i[t] = 0
for i in Field:
if sum(i) == 0:
count+=1
for i in range(3):
if Field[0][i] == 0 and Field[1][i] == 0 and Field[2][i] == 0:
count+=1
if Field[0][0] == 0 and Field[1][1] == 0 and Field[2][2] == 0:
count+=1
if Field[0][2] == 0 and Field[1][1] == 0 and Field[2][0] == 0:
count+=1
if count != 0:
print("Yes")
else:
print("No")
|
p02760
|
A = [list(map(int,input().split())) for _ in range(3)]
N = int(eval(input()))
B = [int(eval(input())) for _ in range(N)]
for i in range(3):
bng = 1
for j in range(3):
if A[i][j] in B:
continue
else:
bng = 0
break
if bng ==1:break
if bng==1:
print("Yes")
else:
for j in range(3):
bng = 1
for i in range(3):
if A[i][j] in B:
continue
else:
bng = 0
break
if bng==1:break
if bng==1:
print("Yes")
else:
if A[0][0] in B and A[1][1] in B and A[2][2] in B:
print("Yes")
elif A[0][2] in B and A[1][1] in B and A[2][0] in B:
print("Yes")
else:
print("No")
|
A = [list(map(int,input().split())) for _ in range(3)]
N = int(eval(input()))
B = [[0 for _ in range(3)] for _ in range(3)]
for _ in range(N):
b = int(eval(input()))
for i in range(3):
for j in range(3):
if A[i][j]==b:
B[i][j] = 1
flag = 0
for i in range(3):
if sum(B[i])==3:
flag = 1
break
for j in range(3):
cnt = 0
for i in range(3):
cnt += B[i][j]
if cnt==3:
flag = 1
break
if B[0][0]+B[1][1]+B[2][2]==3:
flag = 1
if B[2][0]+B[1][1]+B[0][2]==3:
flag = 1
if flag==1:
print("Yes")
else:
print("No")
|
p02760
|
*a,=list(map(int,open(0).read().split()));print(('YNeos'[all(t-set(map(a.index,a[10:]))for t in({0,1,2},{0,3,6},{0,4,8},{1,4,7},{2,4,6},{2,5,8},{3,4,5},{6,7,8}))::2]))
|
a=open(0).read().split();print(('YNeos'[all(t-set(map(a.index,a[10:]))for t in({0,1,2},{0,3,6},{0,4,8},{1,4,7},{2,4,6},{2,5,8},{3,4,5},{6,7,8}))::2]))
|
p02760
|
a=open(0).read().split();print(('YNeos'[all(t-set(map(a.index,a[10:]))for t in({0,3,6},{0,4,8},{1,4,7},{2,4,6},{2,5,8},{3,4,5},{6,7,8}))::2]))
|
a=open(0).read().split();print(('YNeos'[all(t-set(map(a.index,a[10:]))for t in({0,3,6},{0,4,8},{2,4,6},{2,5,8},{3,4,5},{6,7,8}))::2]))
|
p02760
|
A1=list(map(int, input().split()))
A2=list(map(int, input().split()))
A3=list(map(int, input().split()))
A=A1+A2+A3
N=int(eval(input()))
s=set()
for _ in range(N):
b=int(eval(input()))
if b in A:
s|={A.index(b)}
bingo=[{0,1,2},{0,3,6},{0,4,8},{1,4,7},{2,4,6},{2,5,8},{3,4,5},{6,7,8}]
print((["No","Yes"][any(s>=b for b in bingo)]))
|
A1=list(map(int, input().split()))
A2=list(map(int, input().split()))
A3=list(map(int, input().split()))
A=A1+A2+A3
N=int(eval(input()))
s=set()
for _ in range(N):
b=int(eval(input()))
if b in A:
s|={A.index(b)}
bingo=[{0,1,2},{0,3,6},{0,4,8},{1,4,7},{2,5,8},{2,4,6},{3,4,5},{6,7,8}]
print((['No','Yes'][any(s>=b for b in bingo)]))
|
p02760
|
a = []
for i in range(3):
a1, a2, a3 = list(map(int, input().split()))
a.append(a1)
a.append(a2)
a.append(a3)
l = [0]*9
n = int(eval(input()))
for i in range(n):
b = int(eval(input()))
if b in a:
l[a.index(b)] += 1
if l[0] == 1 and l[1] == 1 and l[2] == 1:
print('Yes')
elif l[3] == 1 and l[4] == 1 and l[5] == 1:
print('Yes')
elif l[6] == 1 and l[7] == 1 and l[8] == 1:
print('Yes')
elif l[0] == 1 and l[3] == 1 and l[6] == 1:
print('Yes')
elif l[1] == 1 and l[4] == 1 and l[7] == 1:
print('Yes')
elif l[2] == 1 and l[5] == 1 and l[8] == 1:
print('Yes')
elif l[0] == 1 and l[4] == 1 and l[8] == 1:
print('Yes')
elif l[2] == 1 and l[4] == 1 and l[6] == 1:
print('Yes')
else:
print('No')
|
a = []
for i in range(3):
a1, a2, a3 = list(map(int, input().split()))
a.append(a1)
a.append(a2)
a.append(a3)
l = [0]*9
n = int(eval(input()))
for i in range(n):
b = int(eval(input()))
for k in range(9):
if a[k] == b:
l[k] += 1
if l[0] == 1 and l[1] == 1 and l[2] == 1:
print('Yes')
elif l[3] == 1 and l[4] == 1 and l[5] == 1:
print('Yes')
elif l[6] == 1 and l[7] == 1 and l[8] == 1:
print('Yes')
elif l[0] == 1 and l[3] == 1 and l[6] == 1:
print('Yes')
elif l[1] == 1 and l[4] == 1 and l[7] == 1:
print('Yes')
elif l[2] == 1 and l[5] == 1 and l[8] == 1:
print('Yes')
elif l[0] == 1 and l[4] == 1 and l[8] == 1:
print('Yes')
elif l[2] == 1 and l[4] == 1 and l[6] == 1:
print('Yes')
else:
print('No')
|
p02760
|
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A3 = list(map(int,input().split()))
n = int(eval(input()))
A = [[0,0,0],[0,0,0],[0,0,0]]
for _ in range(n):
b = int(eval(input()))
if b in A1:
tmp = A1.index(b)
A[0][tmp] = 1
elif b in A2:
tmp = A2.index(b)
A[1][tmp] = 1
elif b in A3:
tmp = A3.index(b)
A[2][tmp] = 1
if A[0][0] + A[0][1] + A[0][2] == 3 or A[1][0] + A[1][1] + A[1][2] == 3 or A[2][0] + A[2][1] + A[2][2] == 3:
print('Yes')
elif A[0][0] + A[1][0] + A[2][0] == 3 or A[0][1] + A[1][1] + A[2][1] == 3 or A[0][2] + A[1][2] + A[2][2] == 3:
print('Yes')
elif A[0][0] + A[1][1] + A[2][2] == 3 or A[0][2] + A[1][1] + A[2][0] == 3:
print('Yes')
else:
print('No')
|
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A3 = list(map(int,input().split()))
n = int(eval(input()))
A = [[0,0,0],[0,0,0],[0,0,0]]
for _ in range(n):
b = int(eval(input()))
if b in A1:
tmp = A1.index(b)
A[0][tmp] = 1
elif b in A2:
tmp = A2.index(b)
A[1][tmp] = 1
elif b in A3:
tmp = A3.index(b)
A[2][tmp] = 1
'''
if A[0][0] + A[0][1] + A[0][2] == 3 or A[1][0] + A[1][1] + A[1][2] == 3 or A[2][0] + A[2][1] + A[2][2] == 3:
print('Yes')
elif A[0][0] + A[1][0] + A[2][0] == 3 or A[0][1] + A[1][1] + A[2][1] == 3 or A[0][2] + A[1][2] + A[2][2] == 3:
print('Yes')
'''
ans = 'No'
for i in range(3):
if A[0][i] == A[1][i] == A[2][i] == 1:
ans = 'Yes'
elif A[i][0] == A[i][1] == A[i][2]== 1:
ans = 'Yes'
if A[0][0] + A[1][1] + A[2][2] == 3 or A[0][2] + A[1][1] + A[2][0] == 3:
ans = 'Yes'
print(ans)
|
p02760
|
import sys
def input():
return sys.stdin.readline().strip()
def main():
a = [[0]*3 for i in range(3)]
for i in range(3):
a[i] = list(map(int, input().split()))
n = int(eval(input()))
b = [0]*n
bingo = "No"
for i in range(n):
b[i] = int(eval(input()))
for k in range(3):
if a[k][0] == b[i]:
a[k][0] = 0
if a[k][1] == b[i]:
a[k][1] = 0
if a[k][2] == b[i]:
a[k][2] = 0
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
bingo = "Yes"
for i in range(3):
if a[0][i]+a[1][i]+a[2][i] == 0:
bingo = "Yes"
if a[0][0]+a[1][1]+a[2][2] == 0:
bingo = "Yes"
if a[2][0]+a[1][1]+a[0][2] == 0:
bingo = "Yes"
print(bingo)
main()
|
import sys
def input():
return sys.stdin.readline().strip()
a = [[0]*3 for i in range(3)]
for i in range(3):
a[i] = list(map(int, input().split()))
n = int(eval(input()))
b = [0]*n
bingo = "No"
for i in range(n):
b[i] = int(eval(input()))
for k in range(3):
if a[k][0] == b[i]:
a[k][0] = 0
if a[k][1] == b[i]:
a[k][1] = 0
if a[k][2] == b[i]:
a[k][2] = 0
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
bingo = "Yes"
for i in range(3):
if a[0][i]+a[1][i]+a[2][i] == 0:
bingo = "Yes"
if a[0][0]+a[1][1]+a[2][2] == 0:
bingo = "Yes"
if a[2][0]+a[1][1]+a[0][2] == 0:
bingo = "Yes"
print(bingo)
|
p02760
|
A = [[]]*3
for T in range(0,3):
A[T] = [int(x) for x in input().split()]
A = sum(A,[])
ATF = [False]*9
N = int(eval(input()))
for TT in range(0,N):
B = int(eval(input()))
if B in A:
ATF[A.index(B)] = True
Flag = 0
if (all(ATF[:3])) or (all(ATF[3:6])) or (all(ATF[6:])):
Flag = 1
elif (all(ATF[::3])) or (all(ATF[1::3])) or (all(ATF[2::3])):
Flag = 1
elif (all(ATF[::4])) or (all(ATF[2:7:2])):
Flag = 1
if Flag:
print('Yes')
else:
print('No')
|
A = [[]]*3
for T in range(0,3):
A[T] = [int(x) for x in input().split()]
A = sum(A,[])
ATF = [False]*9
N = int(eval(input()))
for TT in range(0,N):
B = int(eval(input()))
if B in A:
ATF[A.index(B)] = True
Flag = False
if (all(ATF[:3])) or (all(ATF[3:6])) or (all(ATF[6:])):
Flag = True
elif (all(ATF[::3])) or (all(ATF[1::3])) or (all(ATF[2::3])):
Flag = True
elif (all(ATF[::4])) or (all(ATF[2:7:2])):
Flag = True
if Flag:
print('Yes')
else:
print('No')
|
p02760
|
def resolve():
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(eval(input()))
b = [int(eval(input())) for i in range(N)]
A = A1 + A2 + A3
checkA = [0]*9
for i in range(N):
if b[i] in A:
checkA[A.index(b[i])] = 1
if checkA[0] + A[1] + A[2] == 3:
print('Yes')
elif checkA[3] + checkA[4] + checkA[5] == 3:
print('Yes')
elif checkA[6] + checkA[7] + checkA[8] == 3:
print('Yes')
elif checkA[0] + checkA[3] + checkA[6] == 3:
print('Yes')
elif checkA[1] + checkA[4] + checkA[7] == 3:
print('Yes')
elif checkA[2] + checkA[5] + checkA[8] == 3:
print('Yes')
elif checkA[0] + checkA[4] + checkA[8] == 3:
print('Yes')
elif checkA[2] + checkA[4] + checkA[6] == 3:
print('Yes')
else:
print('No')
resolve()
|
def resolve():
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(eval(input()))
b = [int(eval(input())) for i in range(N)]
A = A1 + A2 + A3
checkA = [0]*9
for i in range(N):
if b[i] in A:
checkA[A.index(b[i])] = 1
if checkA[0] + checkA[1] + checkA[2] == 3:
print('Yes')
elif checkA[3] + checkA[4] + checkA[5] == 3:
print('Yes')
elif checkA[6] + checkA[7] + checkA[8] == 3:
print('Yes')
elif checkA[0] + checkA[3] + checkA[6] == 3:
print('Yes')
elif checkA[1] + checkA[4] + checkA[7] == 3:
print('Yes')
elif checkA[2] + checkA[5] + checkA[8] == 3:
print('Yes')
elif checkA[0] + checkA[4] + checkA[8] == 3:
print('Yes')
elif checkA[2] + checkA[4] + checkA[6] == 3:
print('Yes')
else:
print('No')
resolve()
|
p02760
|
def B():
a = [list(map(int,input().split())) for i in range(3)]
n = int(eval(input()))
#b = [list(map(int,input().split())) for i in range(n)]
for bingo in (int(eval(input())) for _ in range(n)):
for i in range(3):
for j in range(3):
if a[i][j] == bingo:
a[i][j] = 0
if (a[0][0] == a[1][1] == a[2][2] == 0) or (a[0][2] == a[1][1] == a[2][0] == 0):
print("Yes")
return
for i in range(3):
if (a[i][0] == a[i][1] == a[i][2] == 0) or (a[0][i] == a[1][i] == a[2][i] == 0):
print("Yes")
return
print("No")
B()
|
def B():
a = [list(map(int,input().split())) for i in range(3)]
n = int(eval(input()))
#b = [list(map(int,input().split())) for i in range(n)]
for bingo in (int(eval(input())) for _ in range(n)):
for i in range(3):
for j in range(3):
if a[i][j] == bingo:
a[i][j] = 0
if (a[0][0] == a[1][1] == a[2][2] == 0) or (a[0][2] == a[1][1] == a[2][0] == 0):
print("Yes")
return
for i in range(3):
if all(a[i][j] == 0 for j in range(3)) or all(a[j][i] == 0 for j in range(3)):
print("Yes")
return
print("No")
B()
|
p02760
|
#!/usr/bin/env python3
import sys
# input
a = [['' for _ in range(3)] for _ in range(3)]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
a[2] = list(map(int, input().split()))
n = int(eval(input()))
b = []
for _ in range(n):
tmp = int(eval(input()))
b.append(tmp)
# calc
f = [['' for _ in range(3)] for _ in range(3)]
for i in range(3):
for j in range(3): f[i][j] = 0
for i in range(3):
for j in range(3):
for k in range(n):
if a[i][j] == b[k]:
f[i][j] = 1
for i in range(3):
s = 0
for j in range(3):
s += f[i][j]
if s == 3:
print('Yes')
sys.exit()
for i in range(3):
s = 0
for j in range(3):
s += f[j][i]
if s == 3:
print('Yes')
sys.exit()
if f[0][0] + f[1][1] + f[2][2] == 3:
print('Yes')
sys.exit()
if f[0][2] + f[1][1] + f[2][0] == 3:
print('Yes')
sys.exit()
print('No')
|
#!/usr/bin/env python3
import sys
# input
a = [list(map(int, input().split())) for _ in range(3)]
n = int(eval(input()))
b = [int(eval(input())) for _ in range(n)]
# calc
f = [[0 for _ in range(3)] for _ in range(3)]
for i in range(3):
for j in range(3):
if a[i][j] in b:
f[i][j] = 1
for i in range(3):
s = 0
u = 0
for j in range(3):
s += f[i][j]
u += f[j][i]
if s == 3 or u == 3:
print('Yes')
sys.exit()
if f[0][0] + f[1][1] + f[2][2] == 3 or f[0][2] + f[1][1] + f[2][0] == 3:
print('Yes')
sys.exit()
print('No')
|
p02760
|
N,M = list(map(int, input().split()))
xyz = [tuple(map(int, input().split())) for _ in range(N)]
constraint = []
for x,y,z in xyz:
ci = []
for b in range(8):
v = 0
if (b>>0)&1==1: v += x
else: v -= x
if (b>>1)&1==1: v += y
else: v -= y
if (b>>2)&1==1: v += z
else: v -= z
ci.append(v)
#print(ci)
constraint.append(ci)
ans = 0
for c in zip(*constraint):
cond = sorted(c, reverse=True)[:M]
ans = max(ans, sum(cond))
print(ans)
|
if __name__ == '__main__':
N,M = list(map(int, input().split()))
xyz = [tuple(map(int, input().split())) for _ in range(N)]
constraint = []
for x,y,z in xyz:
ci = []
for b in range(8):
v = 0
if (b>>0)&1==1: v += x
else: v -= x
if (b>>1)&1==1: v += y
else: v -= y
if (b>>2)&1==1: v += z
else: v -= z
ci.append(v)
#print(ci)
constraint.append(ci)
ans = 0
for c in zip(*constraint):
cond = sorted(c, reverse=True)[:M]
ans = max(ans, sum(cond))
print(ans)
|
p03326
|
import itertools
N,M = [int(i) for i in input().split(' ')]
x = []
for i in range(N):
x.append([int(i) for i in input().split(' ')])
ans = 0
p = list(itertools.permutations(x,M));
for i in p:
A=0
B =0
C=0
for j in range(M):
A += i[j][0]
B += i[j][1]
C += i[j][2]
if A<0:
A = -A
if B<0:
B = -B
if C<0:
C = -C
a = A+B+C
if a > ans:
ans = a
#print(p)
print(ans)
|
import itertools
N,M = [int(i) for i in input().split(' ')]
x = []
for i in range(N):
x.append([int(i) for i in input().split(' ')])
tab = [0]*N
ans = 0
#p = list(itertools.permutations(x,M));
for S in [[1,1,1],[1,1,-1],[1,-1,1],[1,-1,-1],[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]:
for j in range(N):
a = 0
a += x[j][0]*S[0]
a += x[j][1]*S[1]
a += x[j][2]*S[2]
tab[j] = a
tab.sort()
# print(tab)
a =0
for j in range(M):
a += tab[N-j-1]
# print(a)
if a > ans:
ans = a
#print(p)
print(ans)
|
p03326
|
[N, M] = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(N)]
def value(xyz, sign):
return sum([xyz[i]*(1 - 2*((sign & (1 << i)) >> i)) for i in range(3)])
print((0 if M == 0 else max([sum([value(a[j], sign) for j in sorted([i for i in range(N)], key = lambda index : value(a[index], sign))[-M:]]) for sign in range(8)])))
|
[N, M] = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(N)]
def v(x, s):
return sum([x[i]*(1 - 2*((s & (1 << i)) >> i)) for i in range(3)])
print((0 if M == 0 else max([sum([v(a[j], s) for j in sorted([i for i in range(N)], key = lambda i : v(a[i], s))[-M:]]) for s in range(8)])))
|
p03326
|
[N, M] = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(N)]
def v(x, s):
return sum([x[i]*(1 - 2*((s & (1 << i)) >> i)) for i in range(3)])
print((0 if M == 0 else max([sum([v(a[j], s) for j in sorted([i for i in range(N)], key = lambda i : v(a[i], s))[-M:]]) for s in range(8)])))
|
[N, M] = list(map(int, input().split()))
a = eval('input().split(),'*N)
print((0 if M==0 else max([sum(sorted([sum([int(x[b])*(s>>b&1or-1)for b in range(3)]) for x in a])[-M:])for s in range(8)])))
|
p03326
|
n,m = list(map(int, input().split()))
a=[]
for i in range(n):
a.append(tuple(map(int, input().split())))
dp = []
for i in range(m+1):
dp.append([0 for j in range(n+1)])
def f(fn):
global dp, a
for i in range(1,m+1):
for j in range(1,n+1):
dp[i][j] = max(dp[i][j-1], dp[i-1][j-1] + fn(a[j-1]))
ans = []
f(lambda x: x[0]+x[1]+x[2])
ans.append(dp[m][n])
f(lambda x: x[0]+x[1]-x[2])
ans.append(dp[m][n])
f(lambda x: x[0]-x[1]+x[2])
ans.append(dp[m][n])
f(lambda x: x[0]-x[1]-x[2])
ans.append(dp[m][n])
f(lambda x: -x[0]+x[1]+x[2])
ans.append(dp[m][n])
f(lambda x: -x[0]+x[1]-x[2])
ans.append(dp[m][n])
f(lambda x: -x[0]-x[1]+x[2])
ans.append(dp[m][n])
f(lambda x: -x[0]-x[1]-x[2])
ans.append(dp[m][n])
print((max(ans)))
|
n,m = list(map(int, input().split()))
a=[]
for i in range(n):
a.append(tuple(map(int, input().split())))
dp = []
for i in range(m+1):
dp.append([0 for j in range(n+1)])
def f(fn):
global dp, a
for i in range(1,m+1):
for j in range(i,n+1):
if j == i:
dp[i][j] = sum(map(fn, a[:j]))
else:
dp[i][j] = max(dp[i][j-1], dp[i-1][j-1] + fn(a[j-1]))
ans = []
f(lambda x: x[0]+x[1]+x[2])
ans.append(dp[m][n])
f(lambda x: x[0]+x[1]-x[2])
ans.append(dp[m][n])
f(lambda x: x[0]-x[1]+x[2])
ans.append(dp[m][n])
f(lambda x: x[0]-x[1]-x[2])
ans.append(dp[m][n])
f(lambda x: -x[0]+x[1]+x[2])
ans.append(dp[m][n])
f(lambda x: -x[0]+x[1]-x[2])
ans.append(dp[m][n])
f(lambda x: -x[0]-x[1]+x[2])
ans.append(dp[m][n])
f(lambda x: -x[0]-x[1]-x[2])
ans.append(dp[m][n])
print((max(ans)))
|
p03326
|
N,M = list(map(int,input().split()))
cake = [list(map(int,input().split())) for _ in range(N)]
ans = 0
for i in range(8):
sign = [0,0,0]
for j in range(3):
sign[j] = (i>>j & 1)
cake_i = []
for k in range(N):
s = 0
for j in range(3):
s += cake[k][j]*(1-2*sign[j])
cake_i.append(s)
cake_i.sort(reverse = True)
ans = max(ans,sum(cake_i[:M]))
print(ans)
|
N, M = list(map(int, input().split()))
C = [tuple(map(int, input().split())) for _ in range(N)]
res = 0
for i in range(8):
D = [0 for _ in range(N)]
for j in range(N):
x, y, z = C[j]
if (i >> 0) & 1:
D[j] += x
else:
D[j] -= x
if (i >> 1) & 1:
D[j] += y
else:
D[j] -= y
if (i >> 2) & 1:
D[j] += z
else:
D[j] -= z
D.sort(reverse=True)
res = max(res, sum(D[:M]))
print(res)
|
p03326
|
# ABC100D - Patisserie ABC
def calc(func: "func") -> int:
cakes = [func(x, y, z) for x, y, z in zip(*[iter(XYZ)] * 3)]
cakes.sort(reverse=1)
return sum(cakes[:M])
def main():
global M, XYZ
N, M, *XYZ = list(map(int, open(0).read().split()))
ans = max(
calc(lambda x, y, z: x + y + z),
calc(lambda x, y, z: x + y - z),
calc(lambda x, y, z: x - y + z),
calc(lambda x, y, z: x - y - z),
calc(lambda x, y, z: -x + y + z),
calc(lambda x, y, z: -x + y - z),
calc(lambda x, y, z: -x - y + z),
calc(lambda x, y, z: -x - y - z),
)
print(ans)
if __name__ == "__main__":
main()
|
# ABC100D - Patisserie ABC
def calc(func: "func") -> int:
cakes = [func(x, y, z) for x, y, z in zip(*[iter(XYZ)] * 3)]
cakes.sort(reverse=1)
return max(sum(cakes[:M]), -sum(cakes[-M:]))
def main():
global M, XYZ
N, M, *XYZ = list(map(int, open(0).read().split()))
if M == 0:
print((0))
return
ans = max(
calc(lambda x, y, z: x + y + z),
calc(lambda x, y, z: x + y - z),
calc(lambda x, y, z: x - y + z),
calc(lambda x, y, z: x - y - z),
)
print(ans)
if __name__ == "__main__":
main()
|
p03326
|
n,m=list(map(int,input().split()))
x,y,z=[],[],[]
for i in range(n):
xi,yi,zi=list(map(int,input().split()))
x.append(xi)
y.append(yi)
z.append(zi)
ans=0
for i in range(2**3):
op=['-','-','-']
for j in range(3):
if (i>>j)&1:
op[j]='+'
tx=x[::]
ty=y[::]
tz=z[::]
if op[0]=='-':
tx=list([-1*a for a in tx])
if op[1]=='-':
ty=list([-1*a for a in ty])
if op[2]=='-':
tz=list([-1*a for a in tz])
xyz_l=[tx[i]+ty[i]+tz[i] for i in range(n)]
xyz_l.sort(reverse=True)
ans=max(ans,sum(xyz_l[:m]))
print(ans)
|
n,m=list(map(int,input().split()))
xyz=[list(map(int,input().split())) for i in range(n)]
ans=0
for i in [-1,1]:
for j in [-1,1]:
for k in [-1,1]:
l=[i*xyz[z][0]+j*xyz[z][1]+k*xyz[z][2] for z in range(n)]
l.sort(reverse=True)
ans=max(ans,sum(l[:m]))
print(ans)
|
p03326
|
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,m=nii()
l=[lnii() for i in range(n)]
ans=0
for i in range(2**3):
t_l=[]
for j in l:
t_num=0
for k in range(3):
if (i>>k)&1:
t_num+=j[k]
else:
t_num-=j[k]
t_l.append(t_num)
t_l.sort(reverse=True)
ans=max(ans,sum(t_l[:m]))
print(ans)
|
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,m=nii()
l=[lnii() for i in range(n)]
ans=0
for i in [1,-1]:
for j in [1,-1]:
for k in [1,-1]:
t_num=0
t_l=[]
for x,y,z in l:
t_num=x*i+y*j+z*k
t_l.append(t_num)
t_l.sort(reverse=True)
ans=max(ans,sum(t_l[:m]))
print(ans)
|
p03326
|
import sys
def input(): return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
cakes = [(0, 0, 0)]
for _ in range(N):
x, y, z = list(map(int, input().split()))
cakes.append((x, y, z))
"""
dp[n][m][t] = (1~n番目までのケーキからm個のケーキをタイプtで選んだ時の合計の最大値)
と定める。ここでタイプとは
t=0 -> val = x + y + z
t=1 -> val = x + y - z
t=2 -> val = x - y + z
t=3 -> val = x - y - z
t=4 -> val = -x + y + z
t=5 -> val = -x + y - z
t=6 -> val = -x - y + z
t=7 -> val = -x - y - z
どのタイプにせよ更新式は同じで、dp[n][m] = max(dp[n-1][m], dp[n-1][m-1] + (n番目のdp = [0]aaa))
"""
dp = [[[0] * 8 for _ in range(M + 1)] for _ in range(N + 1)]
for n in range(1, N + 1):
x, y, z = cakes[n]
for m in range(1, min(M + 1, n + 1)):
if n == m:
dp[n][m][0] = dp[n - 1][m - 1][0] + (x + y + z)
dp[n][m][1] = dp[n - 1][m - 1][1] + (x + y - z)
dp[n][m][2] = dp[n - 1][m - 1][2] + (x - y + z)
dp[n][m][3] = dp[n - 1][m - 1][3] + (x - y - z)
dp[n][m][4] = dp[n - 1][m - 1][4] + (-x + y + z)
dp[n][m][5] = dp[n - 1][m - 1][5] + (-x + y - z)
dp[n][m][6] = dp[n - 1][m - 1][6] + (-x - y + z)
dp[n][m][7] = dp[n - 1][m - 1][7] + (-x - y - z)
else:
dp[n][m][0] = max(dp[n - 1][m][0], dp[n - 1][m - 1][0] + (x + y + z))
dp[n][m][1] = max(dp[n - 1][m][1], dp[n - 1][m - 1][1] + (x + y - z))
dp[n][m][2] = max(dp[n - 1][m][2], dp[n - 1][m - 1][2] + (x - y + z))
dp[n][m][3] = max(dp[n - 1][m][3], dp[n - 1][m - 1][3] + (x - y - z))
dp[n][m][4] = max(dp[n - 1][m][4], dp[n - 1][m - 1][4] + (-x + y + z))
dp[n][m][5] = max(dp[n - 1][m][5], dp[n - 1][m - 1][5] + (-x + y - z))
dp[n][m][6] = max(dp[n - 1][m][6], dp[n - 1][m - 1][6] + (-x - y + z))
dp[n][m][7] = max(dp[n - 1][m][7], dp[n - 1][m - 1][7] + (-x - y - z))
print((max(dp[N][M])))
if __name__ == "__main__":
main()
|
import sys
def input(): return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
cakes = [(0, 0, 0)]
for _ in range(N):
x, y, z = list(map(int, input().split()))
cakes.append((x, y, z))
"""
これはdpするべきではなかった。O(NlogN)で解ける。
単純にx+y+zやx-y-z等のそれぞれに対してcakesをソートして大きい値から取れば良い。
"""
ans = 0
for i in range(8):
sorted_cakes = []
for j in range(1, N + 1):
S = 0
for k in range(3): # iの立っているビットでx, y, zの符号を管理している！！
if i & (1 << k):
S += cakes[j][k]
else:
S -= cakes[j][k]
sorted_cakes.append(S)
sorted_cakes.sort()
ans = max(ans, sum(sorted_cakes[N - M:]))
print(ans)
if __name__ == "__main__":
main()
|
p03326
|
from itertools import combinations
from sys import stdin, stdout
input = lambda: stdin.readline().rstrip()
println = stdout.write
def main():
N, M = list(map(int, input().split()))
XYZ = [tuple(map(int, input().split())) for _ in [0] * N]
ans = -float('inf')
for cake in combinations(XYZ, M):
x, y, z = 0, 0, 0
for i, j, k in cake:
x += i; y += j; z += k
for xm in (x, -x):
for ym in (y, -y):
for zm in (z, -z):
ans = max(ans, xm + ym + zm)
print(ans)
main()
|
from itertools import combinations, product
from sys import stdin, stdout
input = lambda: stdin.readline().rstrip()
println = stdout.write
def main():
N, M = list(map(int, input().split()))
XYZ = [tuple(map(int, input().split())) for _ in [0] * N]
cake = [0] * N
ans = -float('inf')
for kx, ky, kz in product((1, -1), repeat=3):
for i, (x, y, z) in enumerate(XYZ):
cake[i] = sum((x * kx, y * ky, z * kz))
cake.sort(reverse=1)
ans = max(ans, sum(cake[:M]))
print(ans)
main()
|
p03326
|
# input
N, M = list(map(int, input().split()))
Cake = [list(map(int, input().split())) for i in range(N)]
Cake_sum = {i:0 for i in range(N)}
# x_i, y_i, z_iの合計の正負で8通りに場合分け
# x_i >= 0, y_i >= 0, z_i >= 0
ans1 = 0
for i in range(N):
Cake_sum[i] = Cake[i][0] + Cake[i][1] + Cake[i][2]
Cake_sorted = sorted(list(Cake_sum.items()), key=lambda x: -x[1])
for j in range(M):
ans1 += Cake_sorted[j][1]
ans2 = 0
# x_i < 0, y_i >= 0, z_i >= 0
for i in range(N):
Cake_sum[i] = -Cake[i][0] + Cake[i][1] + Cake[i][2]
Cake_sorted = sorted(list(Cake_sum.items()), key=lambda x: -x[1])
for j in range(M):
ans2 += Cake_sorted[j][1]
ans3 = 0
# x_i >= 0, y_i < 0, z_i >= 0
for i in range(N):
Cake_sum[i] = Cake[i][0] - Cake[i][1] + Cake[i][2]
Cake_sorted = sorted(list(Cake_sum.items()), key=lambda x: -x[1])
for j in range(M):
ans3 += Cake_sorted[j][1]
ans4 = 0
# x_i >= 0, y_i >= 0, z_i < 0
for i in range(N):
Cake_sum[i] = Cake[i][0] + Cake[i][1] - Cake[i][2]
Cake_sorted = sorted(list(Cake_sum.items()), key=lambda x: -x[1])
for j in range(M):
ans4 += Cake_sorted[j][1]
ans5 = 0
# x_i < 0, y_i < 0, z_i >= 0
for i in range(N):
Cake_sum[i] = -Cake[i][0] - Cake[i][1] + Cake[i][2]
Cake_sorted = sorted(list(Cake_sum.items()), key=lambda x: -x[1])
for j in range(M):
ans5 += Cake_sorted[j][1]
ans6 = 0
# x_i >= 0, y_i < 0, z_i < 0
for i in range(N):
Cake_sum[i] = Cake[i][0] - Cake[i][1] - Cake[i][2]
Cake_sorted = sorted(list(Cake_sum.items()), key=lambda x: -x[1])
for j in range(M):
ans6 += Cake_sorted[j][1]
ans7 = 0
# x_i < 0, y_i >= 0, z_i < 0
for i in range(N):
Cake_sum[i] = -Cake[i][0] + Cake[i][1] - Cake[i][2]
Cake_sorted = sorted(list(Cake_sum.items()), key=lambda x: -x[1])
for j in range(M):
ans7 += Cake_sorted[j][1]
ans8 = 0
# x_i < 0, y_i < 0, z_i < 0
for i in range(N):
Cake_sum[i] = -Cake[i][0] - Cake[i][1] - Cake[i][2]
Cake_sorted = sorted(list(Cake_sum.items()), key=lambda x: -x[1])
for j in range(M):
ans8 += Cake_sorted[j][1]
ans = max(ans1, ans2, ans3, ans4, ans5, ans6, ans7, ans8)
print(ans)
|
# input
N, M = list(map(int, input().split()))
Cake = [list(map(int, input().split())) for i in range(N)]
Cake_sum = [0 for i in range(N)]
# sum(x_i), sum(y_i), sum(z_i)の正負で8通りに場合分け
# x_i >= 0, y_i >= 0, z_i >= 0
ans1 = 0
for i in range(N):
Cake_sum[i] = Cake[i][0] + Cake[i][1] + Cake[i][2]
Cake_sum_sorted = sorted(Cake_sum, reverse = True)
for j in range(M):
ans1 += Cake_sum_sorted[j]
ans2 = 0
# x_i < 0, y_i >= 0, z_i >= 0
for i in range(N):
Cake_sum[i] = -Cake[i][0] + Cake[i][1] + Cake[i][2]
Cake_sum_sorted = sorted(Cake_sum, reverse = True)
for j in range(M):
ans2 += Cake_sum_sorted[j]
ans3 = 0
# x_i >= 0, y_i < 0, z_i >= 0
for i in range(N):
Cake_sum[i] = Cake[i][0] - Cake[i][1] + Cake[i][2]
Cake_sum_sorted = sorted(Cake_sum, reverse = True)
for j in range(M):
ans3 += Cake_sum_sorted[j]
ans4 = 0
# x_i >= 0, y_i >= 0, z_i < 0
for i in range(N):
Cake_sum[i] = Cake[i][0] + Cake[i][1] - Cake[i][2]
Cake_sum_sorted = sorted(Cake_sum, reverse = True)
for j in range(M):
ans4 += Cake_sum_sorted[j]
ans5 = 0
# x_i < 0, y_i < 0, z_i >= 0
for i in range(N):
Cake_sum[i] = -Cake[i][0] - Cake[i][1] + Cake[i][2]
Cake_sum_sorted = sorted(Cake_sum, reverse = True)
for j in range(M):
ans5 += Cake_sum_sorted[j]
ans6 = 0
# x_i >= 0, y_i < 0, z_i < 0
for i in range(N):
Cake_sum[i] = Cake[i][0] - Cake[i][1] - Cake[i][2]
Cake_sum_sorted = sorted(Cake_sum, reverse = True)
for j in range(M):
ans6 += Cake_sum_sorted[j]
ans7 = 0
# x_i < 0, y_i >= 0, z_i < 0
for i in range(N):
Cake_sum[i] = -Cake[i][0] + Cake[i][1] - Cake[i][2]
Cake_sum_sorted = sorted(Cake_sum, reverse = True)
for j in range(M):
ans7 += Cake_sum_sorted[j]
ans8 = 0
# x_i < 0, y_i < 0, z_i < 0
for i in range(N):
Cake_sum[i] = -Cake[i][0] - Cake[i][1] - Cake[i][2]
Cake_sum_sorted = sorted(Cake_sum, reverse = True)
for j in range(M):
ans8 += Cake_sum_sorted[j]
ans = max(ans1, ans2, ans3, ans4, ans5, ans6, ans7, ans8)
print(ans)
|
p03326
|
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for bit in range(1 << 3):
dp = [-float('inf')] * (M+1)
dp[0] = 0
for i in range(N):
for j in range(M)[::-1]:
if dp[j] != -float('inf'):
score = 0
for k in range(3):
score += xyz[i][k] * (-1)**((bit >> k) & 1)
dp[j+1] = max(dp[j+1], dp[j] + score)
ans = max(ans, dp[M])
print(ans)
|
N, M = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for bit in range(1 << 3):
scores = [0] * N
for i in range(N):
for j in range(3):
scores[i] += xyz[i][j] * (-1)**((bit >> j) & 1)
scores.sort(reverse=True)
ans = max(ans, sum(scores[:M]))
print(ans)
|
p03326
|
N,M=list(map(int,input().split()))
xyz=[]
for i in range(N):
xyz.append(list(map(int,input().split())))
coefs=[[1,1,1],[1,1,-1],[1,-1,1],[1,-1,-1]
,[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]
ans=[]
for ix,iy,iz in coefs:
xyz_ = [sum([ix*l[0],iy*l[1],iz*l[2]]) for l in xyz]
dp=[[0]*(M+1) for i in range(N+1)]
for i in range(N):
dp[i+1][0] = dp[i][0]
for j in range(1,M+1):
dp[i+1][j] = max(dp[i][j-1]+xyz_[i],dp[i][j])
ans.append(dp[N][M])
print((max(ans)))
|
N,M=list(map(int,input().split()))
xyz=[]
for i in range(N):
xyz.append(list(map(int,input().split())))
coefs=[[1,1,1],[1,1,-1],[1,-1,1],[1,-1,-1]
,[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]
ans=[]
for ix,iy,iz in coefs:
xyz_ = [sum([ix*l[0],iy*l[1],iz*l[2]]) for l in xyz]
ans.append(sum(sorted(xyz_,reverse=True)[:M]))
print((max(ans)))
|
p03326
|
N, M = list(map(int, input().split()))
cake = [list(map(int, input().split())) for _ in range(N)]
dp = [[[0] * 8 for _ in range(M + 1)] for _ in range(N + 1)]
for i in range(1, N + 1):
x, y, z = cake[i - 1]
for j in range(1, M + 1):
for msk in range(8):
mx = x * (1 - 2 * (msk >> 2 & 1))
my = y * (1 - 2 * (msk >> 1 & 1))
mz = z * (1 - 2 * (msk >> 0 & 1))
dp[i][j][msk] = max(dp[i - 1][j][msk],
dp[i - 1][j - 1][msk] + mx + my + mz)
print((max(dp[N][M][i] for i in range(8))))
|
N, M = list(map(int, input().split()))
cake = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 18
dp = [[[-INF] * 8 for _ in range(M + 1)] for _ in range(N + 1)]
for i in range(N + 1):
for msk in range(8):
dp[i][0][msk] = 0
for i in range(1, N + 1):
x, y, z = cake[i - 1]
for j in range(1, M + 1):
for msk in range(8):
mx = x * (1 - 2 * (msk >> 2 & 1))
my = y * (1 - 2 * (msk >> 1 & 1))
mz = z * (1 - 2 * (msk >> 0 & 1))
dp[i][j][msk] = max(dp[i - 1][j][msk],
dp[i - 1][j - 1][msk] + mx + my + mz)
print((max(dp[N][M][i] for i in range(8))))
|
p03326
|
N, M = list(map(int, input().split()))
cake = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 18
dp = [[[-INF] * 8 for _ in range(M + 1)] for _ in range(N + 1)]
for i in range(N + 1):
for msk in range(8):
dp[i][0][msk] = 0
for i in range(1, N + 1):
x, y, z = cake[i - 1]
for j in range(1, M + 1):
for msk in range(8):
mx = x * (1 - 2 * (msk >> 2 & 1))
my = y * (1 - 2 * (msk >> 1 & 1))
mz = z * (1 - 2 * (msk >> 0 & 1))
dp[i][j][msk] = max(dp[i - 1][j][msk],
dp[i - 1][j - 1][msk] + mx + my + mz)
print((max(dp[N][M][i] for i in range(8))))
|
N, M = list(map(int, input().split()))
cake = [list(map(int, input().split())) for _ in range(N)]
ans = [[] for _ in range(8)]
for x, y, z in cake:
for msk in range(8):
mx = x * (1 - 2 * (msk >> 2 & 1))
my = y * (1 - 2 * (msk >> 1 & 1))
mz = z * (1 - 2 * (msk >> 0 & 1))
ans[msk].append(mx + my + mz)
print((max(sum(sorted(x, reverse=True)[:M]) for x in ans)))
|
p03326
|
import sys
N,M=list(map(int,input().split()))
if M==0:
print((0))
sys.exit(0)
xyzlist=[]
for i in range(N):
x,y,z=list(map(int,input().split()))
xyzlist.append((x,y,z))
#print(xyzlist)
selected_list1=[False]*N
pt_list=[0,0,0]
for _ in range(M):
max_ind=-1
max_point=-10**20
for i in range(N):
if selected_list1[i]:
continue
x,y,z=xyzlist[i]
point=abs(pt_list[0]+x)-abs(pt_list[0])+abs(pt_list[1]+y)-abs(pt_list[1])+abs(pt_list[2]+z)-abs(pt_list[2])
if max_point<point:
max_ind=i
max_point=point
#print(max_ind+1,xyzlist[max_ind])
selected_list1[max_ind]=True
mx,my,mz=xyzlist[max_ind]
pt_list=[pt_list[0]+mx,pt_list[1]+my,pt_list[2]+mz]
#print(pt_list)
#print(selected_list1)
#print(pt_list)
answer1=0
for i in range(3):
answer1+=abs(pt_list[i])
#print(answer1)
maxabs_ind=[-1,-1,-1]
maxabs=[-1,-1,-1]
for i in range(N):
x,y,z=xyzlist[i]
if abs(x)>maxabs[0]:
maxabs_ind[0]=i
maxabs[0]=abs(x)
if abs(y)>maxabs[1]:
maxabs_ind[1]=i
maxabs[1]=abs(y)
if abs(z)>maxabs[2]:
maxabs_ind[2]=i
maxabs[2]=abs(z)
#print(maxabs_ind)
selected_list2=[False]*N
selected_list2[maxabs_ind[0]]=True
pt_list=list(xyzlist[maxabs_ind[0]])
#print(pt_list)
for _ in range(M-1):
max_ind=-1
max_point=-10**20
for i in range(N):
if selected_list2[i]:
continue
x,y,z=xyzlist[i]
point=abs(pt_list[0]+x)-abs(pt_list[0])+abs(pt_list[1]+y)-abs(pt_list[1])+abs(pt_list[2]+z)-abs(pt_list[2])
if max_point<point:
max_ind=i
max_point=point
#print(max_ind+1,xyzlist[max_ind])
selected_list2[max_ind]=True
mx,my,mz=xyzlist[max_ind]
pt_list=[pt_list[0]+mx,pt_list[1]+my,pt_list[2]+mz]
#print(pt_list)
#print(selected_list2)
#print(pt_list)
answer2=0
for i in range(3):
answer2+=abs(pt_list[i])
#print(answer2)
selected_list3=[False]*N
selected_list3[maxabs_ind[1]]=True
pt_list=list(xyzlist[maxabs_ind[1]])
#print(pt_list)
for _ in range(M-1):
max_ind=-1
max_point=-10**20
for i in range(N):
if selected_list3[i]:
continue
x,y,z=xyzlist[i]
point=abs(pt_list[0]+x)-abs(pt_list[0])+abs(pt_list[1]+y)-abs(pt_list[1])+abs(pt_list[2]+z)-abs(pt_list[2])
if max_point<point:
max_ind=i
max_point=point
#print(max_ind+1,xyzlist[max_ind])
selected_list3[max_ind]=True
mx,my,mz=xyzlist[max_ind]
pt_list=[pt_list[0]+mx,pt_list[1]+my,pt_list[2]+mz]
#print(pt_list)
#print(selected_list3)
#print(pt_list)
answer3=0
for i in range(3):
answer3+=abs(pt_list[i])
#print(answer3)
selected_list4=[False]*N
selected_list4[maxabs_ind[2]]=True
pt_list=list(xyzlist[maxabs_ind[2]])
#print(pt_list)
for _ in range(M-1):
max_ind=-1
max_point=-10**20
for i in range(N):
if selected_list4[i]:
continue
x,y,z=xyzlist[i]
point=abs(pt_list[0]+x)-abs(pt_list[0])+abs(pt_list[1]+y)-abs(pt_list[1])+abs(pt_list[2]+z)-abs(pt_list[2])
if max_point<point:
max_ind=i
max_point=point
#print(max_ind+1,xyzlist[max_ind])
selected_list4[max_ind]=True
mx,my,mz=xyzlist[max_ind]
pt_list=[pt_list[0]+mx,pt_list[1]+my,pt_list[2]+mz]
#print(pt_list)
#print(selected_list3)
#print(pt_list)
answer4=0
for i in range(3):
answer4+=abs(pt_list[i])
#print(answer4)
#print(answer1,answer2,answer3,answer4)
print((max(answer1,answer2,answer3,answer4)))
|
import sys
N,M=list(map(int,input().split()))
xyzlist=[]
for i in range(N):
x,y,z=list(map(int,input().split()))
xyzlist.append((x,y,z))
#print(xyzlist)
answer=0
for b in range(2**3):
bit=[0]*3
for i in range(3):
bit[i]=b%2
b//=2
#print(bit)
slist=[]
for x,y,z in xyzlist:
if bit[0]==1:
x=-x
if bit[1]==1:
y=-y
if bit[2]==1:
z=-z
slist.append(x+y+z)
slist.sort(reverse=True)
answer=max(answer,sum(slist[:M]))
print(answer)
|
p03326
|
n,m = [int(i) for i in input().split()]
cakes = []
ranking = [[] for i in range(8)]
ranking2 = []
for i in range(n):
cakes.append(list(map(int,input().split())))
a = 0
for i in range(2):
for j in range(2):
for k in range(2):
for x in range(n):
kirei = cakes[x][0]
oisii = cakes[x][1]
ninki = cakes[x][2]
if i ==1:
kirei = (-1)*kirei
if j ==1:
oisii = (-1) * oisii
if k==1:
ninki = (-1)*ninki
sum = kirei + oisii + ninki
ranking[a].append(sum)
a += 1
for i in ranking:
i = sorted(i)
i = i[::-1]
ranking2.append(i)
ans = 0
maxi = 0
for x in ranking2:
ans = 0
for i in range(m):
ans += x[i]
maxi = max(maxi,ans)
print(maxi)
|
n,m = [int(i) for i in input().split()]
ck = []
for i in range(n):
ck.append(list(map(int,input().split())))
co1=co2=co3=-1
scores = []
maxi = 0
for i in range(2):
co1 *= -1
for j in range(2):
co2 *= -1
for k in range(2):
co3*= -1
scores = []
score = 0
for a,b,c in ck:
scores.append(a*co1 + b*co2 + c*co3)
scores.sort()
for x in range(1,m+1):
score += scores[-x]
maxi = max(maxi,score)
print(maxi)
|
p03326
|
import itertools as it
def f(c):
x = abs(sum([i[0] for i in c]))
y = abs(sum([i[1] for i in c]))
z = abs(sum([i[2] for i in c]))
return x + y + z
N, M = tuple(map(int, input().split()))
v = [[int(x) for x in input().split()] for j in range(N)]
c = list(it.combinations(v, M))
print((max(f(x) for x in c)))
|
N, M = tuple(map(int, input().split()))
v = [[int(x) for x in input().split()] for j in range(N)]
v2 = [[v[i][0]*p + v[i][1]*q + v[i][2]*r for i in range(N)] for p in [1, -1] for q in [1, -1] for r in [1, -1]]
v3 = [sorted(v2[i], reverse=True) for i in range(8)]
m = 0
for i in range(8):
n = sum(v3[i][:M])
if n > m:
m = n
print(m)
|
p03326
|
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest
if __name__ == '__main__':
from itertools import product
from heapq import nlargest
n, m = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for i in range(n)]
ans = 0
# See:
# https://beta.atcoder.jp/contests/abc100/submissions/2691346
for a, b, c in product((-1, 1), repeat=3):
summed_xyz = [0 for _ in range(n)]
i = 0
for x, y, z in xyz:
summed_xyz[i] = (x * a) + (y * b) + (z * c)
i += 1
ans = max(ans, sum(nlargest(m, summed_xyz)))
print(ans)
|
# -*- coding: utf-8 -*-
def main():
from itertools import product
n, m = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for op1, op2, op3 in list(product([1, -1], repeat=3)):
tmp = [[0, 0, 0]] * n
for index, value in enumerate(xyz):
tmp[index] = sum([op1 * value[0], op2 * value[1], op3 * value[2]])
camdidates = sorted(tmp, reverse=True)
ans = max(ans, sum(camdidates[:m]))
print(ans)
if __name__ == '__main__':
main()
|
p03326
|
L=lambda:list(map(int,input().split()));r=range;n,m=L();k=[L()for _ in r(n)];print((max(-sum(sorted([-sum([j[i]*(int(bin(s)[2:].zfill(3)[i])*2-1)for i in r(3)])for j in k])[:m])for s in r(8))))
|
n,m=list(map(int,input().split()))
xyz=[list(map(int,input().split()))for _ in range(n)]
def f(fx,fy,fz):
t=[]
for x,y,z in xyz:t.append(x*fx+y*fy+z*fz)
t.sort(reverse=1)
return sum(t[:m])
ans=0
ans=max(ans,f(1,1,1))
ans=max(ans,f(1,1,-1))
ans=max(ans,f(1,-1,1))
ans=max(ans,f(1,-1,-1))
ans=max(ans,f(-1,1,1))
ans=max(ans,f(-1,1,-1))
ans=max(ans,f(-1,-1,1))
ans=max(ans,f(-1,-1,-1))
print(ans)
|
p03326
|
N,M=list(map(int,input().split()))
dp_ppp=[-1000000]*(N+1)
dp_mpp=[-1000000]*(N+1)
dp_pmp=[-1000000]*(N+1)
dp_ppm=[-1000000]*(N+1)
dp_mmp=[-1000000]*(N+1)
dp_mpm=[-1000000]*(N+1)
dp_pmm=[-1000000]*(N+1)
dp_mmm=[-1000000]*(N+1)
dp_ppp[0]=0
dp_mpp[0]=0
dp_pmp[0]=0
dp_ppm[0]=0
dp_mmp[0]=0
dp_mpm[0]=0
dp_pmm[0]=0
dp_mmm[0]=0
for i in range(N):
x,y,z=list(map(int,input().split()))
for j in range(min(i+1,M),0,-1):
if dp_ppp[j-1]>=0:
dp_ppp[j]=max([dp_ppp[j],dp_ppp[j-1]+x+y+z])
if dp_mpp[j-1]>=0:
dp_mpp[j]=max([dp_mpp[j],dp_mpp[j-1]-x+y+z])
if dp_pmp[j-1]>=0:
dp_pmp[j]=max([dp_pmp[j],dp_pmp[j-1]+x-y+z])
if dp_ppm[j-1]>=0:
dp_ppm[j]=max([dp_ppm[j],dp_ppm[j-1]+x+y-z])
if dp_mmp[j-1]>=0:
dp_mmp[j]=max([dp_mmp[j],dp_mmp[j-1]-x-y+z])
if dp_mpm[j-1]>=0:
dp_mpm[j]=max([dp_mpm[j],dp_mpm[j-1]-x+y-z])
if dp_pmm[j-1]>=0:
dp_pmm[j]=max([dp_pmm[j],dp_pmm[j-1]+x-y-z])
if dp_mmm[j-1]>=0:
dp_mmm[j]=max([dp_mmm[j],dp_mmm[j-1]-x-y-z])
ans=max([dp_ppp[M],dp_mpp[M],dp_pmp[M],dp_ppm[M],dp_mmp[M],dp_mpm[M],dp_pmm[M],dp_mmm[M]])
if ans>0:
print(ans)
else:
print((0))
|
import sys
input=sys.stdin.readline
N,M=list(map(int,input().split()))
dp_ppp=[]
dp_mpp=[]
dp_pmp=[]
dp_ppm=[]
dp_mmp=[]
dp_mpm=[]
dp_pmm=[]
dp_mmm=[]
for i in range(N):
x,y,z=list(map(int,input().split()))
dp_ppp.append(x+y+z)
dp_mpp.append(-x+y+z)
dp_pmp.append(x-y+z)
dp_ppm.append(x+y-z)
dp_mmp.append(-x-y+z)
dp_mpm.append(-x+y-z)
dp_pmm.append(x-y-z)
dp_mmm.append(-x-y-z)
dp_ppp.sort(key=lambda x:-x)
dp_mpp.sort(key=lambda x:-x)
dp_pmp.sort(key=lambda x:-x)
dp_ppm.sort(key=lambda x:-x)
dp_mmp.sort(key=lambda x:-x)
dp_mpm.sort(key=lambda x:-x)
dp_pmm.sort(key=lambda x:-x)
dp_mmm.sort(key=lambda x:-x)
ppp=sum(dp_ppp[0:M])
mpp=sum(dp_mpp[0:M])
pmp=sum(dp_pmp[0:M])
ppm=sum(dp_ppm[0:M])
mmp=sum(dp_mmp[0:M])
mpm=sum(dp_mpm[0:M])
pmm=sum(dp_pmm[0:M])
mmm=sum(dp_mmm[0:M])
ans=max([ppp,mpp,pmp,ppm,mmp,mpm,pmm,mmm])
print(ans)
|
p03326
|
#!/usr/bin/env python3
from itertools import product
n, m = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for i in range(n)]
dp = [[0 for i in range(m+1)] for j in range(n+1)]
# eval
# eval_list = ["+xyz[i-1][0]+xyz[i-1][1]+xyz[i-1][2]",
# "+xyz[i-1][0]+xyz[i-1][1]-xyz[i-1][2]",
# "+xyz[i-1][0]-xyz[i-1][1]+xyz[i-1][2]",
# "+xyz[i-1][0]-xyz[i-1][1]-xyz[i-1][2]",
# "-xyz[i-1][0]+xyz[i-1][1]+xyz[i-1][2]",
# "-xyz[i-1][0]+xyz[i-1][1]-xyz[i-1][2]",
# "-xyz[i-1][0]-xyz[i-1][1]+xyz[i-1][2]",
# "-xyz[i-1][0]-xyz[i-1][1]-xyz[i-1][2]", ]
ans = []
for a, b, c in product([1, -1], repeat=3):
for i in range(1, n+1):
for j in range(1, min(i+1, m+1)):
tmp = xyz[i-1][0]*a + xyz[i-1][1]*b + xyz[i-1][2]*c
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] + tmp)
ans.append(dp[-1][-1])
print((max(ans)))
|
#!/usr/bin/env python3
from itertools import product
n, m = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for i in range(n)]
dp = [[0 for i in range(m+1)] for j in range(n+1)]
# eval
# eval_list = ["+xyz[i-1][0]+xyz[i-1][1]+xyz[i-1][2]",
# "+xyz[i-1][0]+xyz[i-1][1]-xyz[i-1][2]",
# "+xyz[i-1][0]-xyz[i-1][1]+xyz[i-1][2]",
# "+xyz[i-1][0]-xyz[i-1][1]-xyz[i-1][2]",
# "-xyz[i-1][0]+xyz[i-1][1]+xyz[i-1][2]",
# "-xyz[i-1][0]+xyz[i-1][1]-xyz[i-1][2]",
# "-xyz[i-1][0]-xyz[i-1][1]+xyz[i-1][2]",
# "-xyz[i-1][0]-xyz[i-1][1]-xyz[i-1][2]", ]
ans = 0
for a, b, c in product([1, -1], repeat=3):
total = []
for x, y, z in xyz:
s = x*a+y*b+z*c
total.append(s)
total.sort(reverse=True)
ans = max(ans, sum(total[:m]))
print(ans)
|
p03326
|
n, m = list(map(int, input().split()))
x = []
y = []
z = []
for i in range(n):
X, Y, Z = list(map(int, input().split()))
x.append(X)
y.append(Y)
z.append(Z)
sign = [1, -1]
ans = []
for j in sign:
for k in sign:
for l in sign:
a = []
for i in range(n):
a.append(x[i] * j + y[i] * k + z[i] * l)
a.sort(reverse=True)
ans.append(sum(a[:m]))
print((max(ans)))
|
n, m = list(map(int, input().split()))
cake = [list(map(int, input().split())) for i in range(n)]
box = [[[[] for i in range(2)] for j in range(2)] for k in range(2)]
ans = 0
for i in range(2):
for j in range(2):
for k in range(2):
worth = 0
for x, y, z in cake:
if i == 1:
x = -x
if j == 1:
y = -y
if k == 1:
z = -z
box[i][j][k].append(x+y+z)
box[i][j][k].sort(reverse=True)
ans = max(ans, sum(box[i][j][k][:m]))
print(ans)
|
p03326
|
import itertools
N, M = list(map(int, input().split()))
lst = [list(map(int, input().rstrip().split())) for n in range(N)]
num = [i for i in range(N)]
maximum = -float("inf")
for p in itertools.combinations(num, M):
m = sum(abs(sum(lst[n][i] for n in p)) for i in range(3))
maximum = max(maximum, m)
print(maximum)
|
N, M = list(map(int, input().split()))
lst = [list(map(int, input().rstrip().split())) for n in range(N)]
maximum = -float("inf")
for i in [-1, 1]:
for j in [-1, 1]:
for k in [-1, 1]:
sum_lst = []
for n in range(N):
num = lst[n][0] * i + lst[n][1] * j + lst[n][2] * k
sum_lst.append(num)
maximum = max(abs(sum(sorted(sum_lst)[:M])), maximum)
print(maximum)
|
p03326
|
import itertools
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
cakes = []
for _ in range(N):
x, y, z = list(map(int, input().split()))
cakes.append((x, y, z))
ans = 0
for i in itertools.combinations(cakes, M):
sx, sy, sz = 0, 0, 0
for j in i:
x, y, z = j
sx = sx + x
sy = sy + y
sz = sz + z
ans = max(ans, abs(sx) + abs(sy) + abs(sz))
print(ans)
|
N, M = list(map(int, input().split()))
cakes = []
for _ in range(N):
x, y, z = list(map(int, input().split()))
cakes.append((x, y, z))
ans = 0
for i in range(2**3):
op1, op2, op3 = 1, 1, 1
for idx, j in enumerate(bin(i)[2:][::-1], 1):
j = int(j)
if idx == 1:
op1 = 1 if j == 0 else -1
elif idx == 2:
op2 = 1 if j == 0 else -1
elif idx == 3:
op3 = 1 if j == 0 else -1
cakes.sort(reverse=True, key=lambda x: op1 * x[0] + op2 * x[1] + op3 * x[2])
sx, sy, sz = 0, 0, 0
for cake in cakes[:M]:
sx += cake[0]
sy += cake[1]
sz += cake[2]
ans = max(ans, abs(sx) + abs(sy) + abs(sz))
print(ans)
|
p03326
|
import sys
sys.setrecursionlimit(50000)
n,m=(int(i) for i in input().strip().split(" "))
xs=[]
ys=[]
zs=[]
for i in range(n):
a,b,c=(int(i) for i in input().strip().split(" "))
xs.append(a)
ys.append(b)
zs.append(c)
def g():
return "no"
from collections import defaultdict
d=defaultdict(g)
def find(l,m,x,y,z):
if d[(l,m,x,y,z)]!="no":
return d[(l,m,x,y,z)]
if m<=0:
return abs(x)+abs(y)+abs(z)
if l<0:
return abs(x)+abs(y)+abs(z)
a=find(l-1,m,x,y,z)
b=find(l-1,m-1,x+xs[l],y+ys[l],z+zs[l])
d[(l, m, x, y, z)]=max(a,b)
return d[(l,m,x,y,z)]
print((find(n-1,m,0,0,0)))
|
import sys
sys.setrecursionlimit(50000)
n, m = (int(i) for i in input().strip().split(" "))
xs = []
ys = []
zs = []
for i in range(n):
a, b, c = (int(i) for i in input().strip().split(" "))
xs.append(a)
ys.append(b)
zs.append(c)
k=0
ar=[]
for i in range(n):
ar.append(xs[i]+ys[i]+zs[i])
ar.sort(reverse=True)
t=sum(ar[:m])
if t>k:
k=t
ar=[]
for i in range(n):
ar.append(xs[i]+ys[i]-zs[i])
ar.sort(reverse=True)
t=sum(ar[:m])
if t>k:
k=t
ar=[]
for i in range(n):
ar.append(xs[i]-ys[i]+zs[i])
ar.sort(reverse=True)
t=sum(ar[:m])
if t>k:
k=t
ar=[]
for i in range(n):
ar.append(-1*xs[i]+ys[i]+zs[i])
ar.sort(reverse=True)
t=sum(ar[:m])
if t>k:
k=t
ar=[]
for i in range(n):
ar.append(xs[i]-ys[i]-zs[i])
ar.sort(reverse=True)
t=sum(ar[:m])
if t>k:
k=t
ar=[]
for i in range(n):
ar.append(-xs[i]+ys[i]-zs[i])
ar.sort(reverse=True)
t=sum(ar[:m])
if t>k:
k=t
ar=[]
for i in range(n):
ar.append(-xs[i]-ys[i]+zs[i])
ar.sort(reverse=True)
t=sum(ar[:m])
if t>k:
k=t
ar=[]
for i in range(n):
ar.append(-xs[i]-ys[i]-zs[i])
ar.sort(reverse=True)
t=sum(ar[:m])
if t>k:
k=t
print(k)
|
p03326
|
import sys
sys.setrecursionlimit(1000000000)
N, M = list(map(int, input().split()))
x, y, z = [], [], []
for _ in range(N):
xyz = list(map(int, input().split()))
x += [xyz[0]]
y += [xyz[1]]
z += [xyz[2]]
def func(i, j, fx, fy, fz, v):
if i > N - 1 or j > M - 1:
return v
r1 = func(i + 1, j + 1, fx + x[i], fy + y[i], fz + z[i],
abs(fx + x[i]) + abs(fy + y[i]) + abs(fz + z[i]))
r2 = func(i + 1, j, fx, fy, fz, v)
v = max(r1, r2)
return v
print((func(0, 0, 0, 0, 0, 0)))
|
N, M = list(map(int, input().split()))
xyz = []
ans = 0
for _ in range(N):
xyz += [list(map(int, input().split()))]
for b in range(2 ** 3):
pm = [1] * 3
for j in range(3):
if (b >> j) & 1:
pm[j] *= -1
r = []
for i in range(N):
r += [pm[0] * xyz[i][0] + pm[1] * xyz[i][1] + pm[2] * xyz[i][2]]
r.sort(reverse=True)
ans = max(ans, sum(r[:M]))
print(ans)
|
p03326
|
from itertools import combinations
N,M = list(map(int,input().split())) # <=1000
xyz = [list(map(int,input().split())) for _ in range(N)]
x = [i[0] for i in xyz]
y = [i[1] for i in xyz]
z = [i[2] for i in xyz]
if M == 0:
print((0))
exit()
result = 0
for s in combinations(list(range(N)),M):
tx = ty = tz = 0
for i in s:
tx += x[i]
ty += y[i]
tz += z[i]
result = max(result,abs(tx)+abs(ty)+abs(tz))
print(result)
|
import itertools
N,M = list(map(int,input().split())) # <=1000
xyz = [list(map(int,input().split())) for _ in range(N)]
if M == 0:
print((0))
exit()
result = 0
L = [[0] * N for i in range(8)]
for i,j in enumerate(itertools.product((-1,1),repeat=3)):
for k,l in enumerate(xyz):
L[i][k] = l[0] * j[0] + l[1] * j[1] + l[2] * j[2]
L[i] = sorted(L[i],reverse=True)
print((max([sum(i[:M]) for i in L])))
|
p03326
|
inf = float('inf')
mod = 10**9+7
from itertools import product, permutations, combinations, combinations_with_replacement
import bisect
N, M = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for i in range(N)]
result = -inf
kireisa = 0
oishisa = 0
ninkido = 0
for i in combinations(list(range(N)), M):
kireisa = 0
oishisa = 0
ninkido = 0
for j in i:
kireisa += xyz[j][0]
oishisa += xyz[j][1]
ninkido += xyz[j][2]
tmp = abs(kireisa)+abs(oishisa)+abs(ninkido)
result = max(result,tmp)
print(result)
|
N, M = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for i in range(N)]
tmp = [[0]*N for i in range(8)]
for n, _ in enumerate(xyz):
x,y,z = _
tmp[0][n] = x+y+z
tmp[1][n] = x+y-z
tmp[2][n] = x-y+z
tmp[3][n] = x-y-z
tmp[4][n] = -x+y+z
tmp[5][n] = -x+y-z
tmp[6][n] = -x-y+z
tmp[7][n] = -x-y-z
result = -float("inf")
for i in range(8):
result = max(result, sum(sorted(tmp[i], reverse=True)[:M]))
print(result)
|
p03326
|
n,m=list(map(int,input().split()))
xyz=[list(map(int,input().split())) for _ in range(n)]
t=[[0]*n for _ in range(8)]
i=0
for x,y,z in xyz:
t[0][i]=x+y+z
t[1][i]=-x+y+z
t[2][i]=x-y+z
t[3][i]=x+y-z
t[4][i]=-x-y+z
t[5][i]=x-y-z
t[6][i]=-x+y-z
t[7][i]=-x-y-z
i+=1
ans=0
for tk in t:
tk.sort(reverse=True)
ans=max(ans,sum(tk[:m]))
print(ans)
|
n, m = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(n)]
if m==0:
print((0))
exit()
t = [[0] * n for _ in range(4)]
i = 0
for x, y, z in xyz:
t[0][i] = x + y + z
t[1][i] = -x + y + z
t[2][i] = x - y + z
t[3][i] = x + y - z
i += 1
ans = 0
for tk in t:
tk.sort()
ans = max(ans, -sum(tk[:m]),sum(tk[-m:]))
print(ans)
|
p03326
|
#ABC100-D Patisserie ABC
"""
+を採用するか-を採用するかで各評価値が2通りなので、
2**3の全探索を行えば良い
"""
import sys
from copy import deepcopy
from operator import itemgetter
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,m = list(map(int,readline().split()))
xyz = []
for i in range(n):
xyz.append(list(map(int,readline().split())))
ans = 0
for i in range(1<<4):
res = [0]*n
for j in range(3):
if i>>j&1==1:
for k in range(n):
res[k] += -xyz[k][j]
else:
for k in range(n):
res[k] += xyz[k][j]
res.sort(reverse=True)
res2 = abs(sum(res[:m]))
ans = max(ans,res2)
print(ans)
|
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,m = list(map(int,readline().split()))
lst1 = []
for i in range(n):
lst1.append(list(map(int,readline().split())))
ans = 0
for i in range(1<<4):
res = [0]*n
for j in range(3):
if i>>j&1:
for k in range(n):
res[k] += lst1[k][j]
else:
for k in range(n):
res[k] -= lst1[k][j]
res.sort(reverse=True)
ans = max(ans,sum(res[:m]))
print(ans)
|
p03326
|
N,M = list(map(int,input().split()))
xs,ys,zs =[],[],[]
comps1 = []
comps2 = []
comps3 = []
comps4 = []
comps5 = []
comps6 = []
comps7 = []
comps8 = []
for i in range(N):
x,y,z = list(map(int,input().split()))
raw = [x+y+z,x+y-z,x-y+z,x-y-z,-x+y+z,-x+y-z,-x-y+z,-x-y-z,]
comps1.append(raw[0])
comps2.append(raw[1])
comps3.append(raw[2])
comps4.append(raw[3])
comps5.append(raw[4])
comps6.append(raw[5])
comps7.append(raw[6])
comps8.append(raw[7])
ans = 0
###
dp = [[0 for _ in range(M+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,M+1):
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+comps1[i-1])
cand = dp[N][M]
ans = max(ans,cand)
###
dp = [[0 for _ in range(M+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,M+1):
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+comps2[i-1])
cand = dp[N][M]
ans = max(ans,cand)
###
dp = [[0 for _ in range(M+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,M+1):
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+comps3[i-1])
cand = dp[N][M]
ans = max(ans,cand)
###
dp = [[0 for _ in range(M+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,M+1):
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+comps4[i-1])
cand = dp[N][M]
ans = max(ans,cand)
###
dp = [[0 for _ in range(M+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,M+1):
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+comps5[i-1])
cand = dp[N][M]
ans = max(ans,cand)
###
dp = [[0 for _ in range(M+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,M+1):
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+comps6[i-1])
cand = dp[N][M]
ans = max(ans,cand)
###
dp = [[0 for _ in range(M+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,M+1):
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+comps7[i-1])
cand = dp[N][M]
ans = max(ans,cand)
###
dp = [[0 for _ in range(M+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,M+1):
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+comps8[i-1])
cand = dp[N][M]
ans = max(ans,cand)
print(ans)
|
N,M = list(map(int,input().split()))
comp = [[] for _ in range(8)]
for i in range(N):
x,y,z = list(map(int,input().split()))
raw = [x+y+z,x+y-z,x-y+z,x-y-z,-x+y+z,-x+y-z,-x-y+z,-x-y-z]
for j in range(8):
comp[j].append(raw[j])
ans = 0
for k in range(8):
comp[k].sort(reverse=True)
sum = 0
for l in range(M):
sum += comp[k][l]
ans = max(ans,sum)
print(ans)
|
p03326
|
n, m = list(map(int, input().split()))
xyz = [tuple(map(int, input().split())) for _ in range(n)]
def isum(i, x, y, z):
s = 0
s += x if (i>>0)&1 else -x
s += y if (i>>1)&1 else -y
s += z if (i>>2)&1 else -z
return s
ans = 0
for i in range(2**3):
dp = [0 for _ in range(m+1)]
for k in range(n):
x, y, z = xyz[k]
ndp = [0 for _ in range(m+1)]
for j in range(1, m+1):
# iを含める場合は、一つ前のj-1から
# iを含めない場合は、一つ前のjから
sumj_1 = dp[j-1]
sj_1 = sumj_1 + isum(i, x, y, z)
noinc_sum = dp[j]
ndp[j] = max(sj_1, noinc_sum)
dp = ndp
ans = max(ans, dp[-1])
print(ans)
|
n, m = list(map(int, input().split()))
xyz = [tuple(map(int, input().split())) for _ in range(n)]
ans = 0
from itertools import product
for p in product([-1, 1], repeat=3):
xyz_ = [l[0]*p[0] + l[1]*p[1] + l[2]*p[2] for l in xyz]
xyz_ = sorted(xyz_, reverse=True)
ans = max(ans, sum(xyz_[:m]))
print(ans)
|
p03326
|
N,M = list(map(int,input().split()))
xyz = [list(map(int,input().split())) for _ in range(N)]
ans = [[] for _ in range(8)]
for x,y,z in xyz:
for i in range(8):
ans[i].append(x*((-1)**i)+y*((-1)**(i//2))+z*((-1)**(i//4)))
out = []
for i in range(8):
ans[i].sort(reverse=True)
out.append(sum(ans[i][:M]))
print((max(out)))
|
N,M = list(map(int,input().split()))
XYZ = [list(map(int,input().split())) for _ in [0]*N]
W = [[0]*N for _ in [0]*4]
for i,xyz in enumerate(XYZ):
x,y,z = xyz
W[0][i] = x+y+z
W[1][i] = x+y-z
W[2][i] = x-y+z
W[3][i] = x-y-z
ans = 0
for i in range(4):
W[i].sort()
ans = max(ans,
abs(sum(W[i][:M])),
abs(sum(W[i][-M:])))
if M==0:ans=0
print(ans)
|
p03326
|
import functools
[N, M] = [int(x) for x in input().split()]
XYZ = []
for i in range(N):
XYZ.append([int(x) for x in input().split()])
result = 0
for x in range(-1, 2, 2):
for y in range(-1, 2, 2):
for z in range(-1, 2, 2):
contribute = [x, y, z]
score = [functools.reduce(lambda a, b: a + b, [xyz[i] * contribute[i] for i in range(3)]) for xyz in XYZ]
score.sort(reverse=True)
S = functools.reduce(lambda a, b: a + b, score[:M]) if M else 0
result = max(result, S)
print(result)
|
N, M = list(map(int, input().split()))
Cakes = [[] for i in range(N)]
for i in range(N):
Cakes[i] = [int(x) for x in input().split()]
ans = 0
for s in range(8):
sx = 1 if s % 2 else -1
sy = 1 if s // 2 % 2 else -1
sz = 1 if s // 4 % 2 else -1
ans = max(sum(sorted([sx * x + sy * y + sz * z for x, y, z in Cakes], reverse=True)[:M]), ans)
print(ans)
|
p03326
|
# coding: utf-8
n, m = [int(x) for x in input().split()]
xx = []
yy = []
zz = []
for _ in range(n):
x, y, z = [int(x) for x in input().split()]
xx.append(x)
yy.append(y)
zz.append(z)
result_points = []
for k in range(8):
max_point = 0
selected_indexes = []
for i in range(m):
max_plus_point = 0
max_index = 0
for j in range(n):
if j in selected_indexes:
continue
plus_point = 0
if k % 2 == 1:
plus_point += xx[j]
else:
plus_point -= xx[j]
if (k // 2) % 2 == 1:
plus_point += yy[j]
else:
plus_point -= yy[j]
if (k // 4) % 2 == 1:
plus_point += zz[j]
else:
plus_point -= zz[j]
if plus_point > max_plus_point:
max_index = j
max_plus_point = plus_point
max_point += max_plus_point
selected_indexes.append(max_index)
result_points.append(max_point)
print((max(result_points)))
|
# coding: utf-8
n, m = [int(x) for x in input().split()]
xx = []
yy = []
zz = []
for _ in range(n):
x, y, z = [int(x) for x in input().split()]
xx.append(x)
yy.append(y)
zz.append(z)
result_points = []
results = []
for i in range(8):
results.append([])
for j in range(n):
plus_point = 0
if i % 2 == 1:
plus_point += xx[j]
else:
plus_point -= xx[j]
if (i // 2) % 2 == 1:
plus_point += yy[j]
else:
plus_point -= yy[j]
if (i // 4) % 2 == 1:
plus_point += zz[j]
else:
plus_point -= zz[j]
results[i].append(plus_point)
results[i].sort()
results[i].reverse()
result_points = []
for i in range(8):
result_points.append(sum(results[i][0:m]))
print((max(result_points)))
|
p03326
|
import itertools
N, M = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(N)]
r = 0
for c in itertools.combinations(l, M):
s = sum(abs(sum(v[i] for v in c)) for i in range(3))
if s > r:
r = s
print(r)
|
N, M = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(N)]
a = 0
for xs in (1, -1):
for ys in (1, -1):
for zs in (1, -1):
l_s = [x*xs + y*ys + z*zs for x, y, z in l]
l_s.sort(reverse=True)
a = max(sum(l_s[:M]), a)
print(a)
|
p03326
|
from itertools import combinations
def score (cids):
x = abs(sum(data[cid][0] for cid in cids))
y = abs(sum(data[cid][1] for cid in cids))
z = abs(sum(data[cid][2] for cid in cids))
return x + y + z
n, m = list(map(int, input().split()))
data = list([int(x) for x in input().split()] for _ in range(n))
print((max(score(x) for x in combinations(list(range(n)), m))))
|
n, m = list(map(int, input().split()))
data = [[int(x) for x in input().split()] for _ in range(n)]
pats = [(x,y,z) for x in [-1,1] for y in [-1,1] for z in [-1,1]] # +++,++-,...,---
score = lambda sgns, vals: sum([s * x for(s, x) in zip(sgns, vals)]) # i.e.x+y-z
result = max(sum(sorted((score(pat, row) for row in data), reverse=True )[:m]) for pat in pats)
print(result)
|
p03326
|
N, M = list(map(int, input().split()))
cakes = []
for _ in range(N):
cakes.append(list(map(int, input().split())))
memo = dict()
def pick_cake(picked):
key = ','.join([str(p) for p in sorted(picked)])
if key in memo:
return memo[key]
if len(picked) == M:
memo[key] = sum([abs(sum([cakes[i][j] for i in picked])) for j in range(3)])
return memo[key]
answer = 0
for i in range(N):
if i in picked:
continue
answer = max(answer, pick_cake(picked + [i]))
memo[key] = answer
return answer
print((pick_cake([])))
|
from itertools import product
N, M = list(map(int, input().split()))
cakes = []
for _ in range(N):
cakes.append(list(map(int, input().split())))
def _eval1(op):
def _eval2(x):
return eval(''.join(['{}{}'.format(op[i], x[i]) for i in range(3)]))
return _eval2
answer = 0
for op in product('+-', repeat=3):
answer = max(answer, sum([abs(sum([cake[j] for cake in sorted(cakes, key=_eval1(op))[:M]])) for j in range(3)]))
print(answer)
|
p03326
|
N,M=list(map(int,input().split()))
xyz=[list(map(int,input().split()))for i in range(N)]
ans=0
for i in range(8):
i=bin(i)[2:].zfill(3)
k=[]
for j in range(3):
if i[j]=="0":
k.append(1)
else:
k.append(-1)
l=[k[0]*x+k[1]*y+k[2]*z for x,y,z in xyz]
l.sort(reverse=True)
ans=max(ans,sum(l[:M]))
print(ans)
|
N,M=list(map(int,input().split()))
xyz=[]
for i in range(N):
x,y,z=list(map(int,input().split()))
xyz.append([x,y,z])
ans=0
for k in range(8):
A=[k>>2 &1,k>>1 &1,k>>0 &1]
l=[]
for i in range(N):
t=0
for j in range(3):
if A[j]==0:
t+=xyz[i][j]
else:
t-=xyz[i][j]
l.append(t)
l.sort(reverse=True)
ans=max(ans,sum(l[:M]))
print(ans)
|
p03326
|
import itertools
if __name__ == '__main__':
n,m = list(map(int,input().split()))
A =[]
for i in range(n):
A.append(list(map(int,input().split())))
maxval = 0
for v in itertools.combinations(A,m):
a = abs(sum(list([x[0] for x in v])))
b = abs(sum(list([x[1] for x in v])))
c = abs(sum(list([x[2] for x in v])))
maxval = max(maxval,a+b+c)
print(maxval)
|
import itertools
if __name__ == '__main__':
n,m = list(map(int,input().split()))
A =[]
for i in range(n):
A.append(list(map(int,input().split())))
P = list(itertools.product([1,-1],repeat=3))
maxval = 0
for p in P:
B=[]
for a in A:
val = (a[0] * p[0]) + (a[1] * p[1]) + (a[2] * p[2])
B.append(val)
#結果をソートして上位ｍ番目までの合計を計算する
C = sorted(B,reverse=True)
maxval = max(maxval,sum(C[:m]))
print(maxval)
|
p03326
|
#おわり、むり
N,W = list(map(int,input().split()))
X,Y,Z = [],[],[]
for i in range(N):
x,y,z = list(map(int,input().split()))
X.append(x)
Y.append(y)
Z.append(z)
dp = [[[0,0,0] for i in range(W+1)] for j in range(N+1)]
for i in range(W+1):
dp[0][i][0]= 0 #X
dp[0][i][1]= 0 #Y
dp[0][i][2]= 0 #Z
ans = 0
for fgo in range(0,8):
FGO = [fgo%2,(fgo//2)%2,(fgo//4)%2]
for i in range(N):
for w in range(W+1):
if w>=1:
x = dp[i][w-1][0]+X[i]
y = dp[i][w-1][1]+Y[i]
z = dp[i][w-1][2]+Z[i]
NOW = (x*pow(-1,FGO[0]))+(y*pow(-1,FGO[1]))+(z*pow(-1,FGO[2]))
BEFORE = sum([dp[i][w][f]*pow(-1,FGO[f]) for f in range(3)])
if NOW > BEFORE:
dp[i+1][w][0] = x
dp[i+1][w][1] = y
dp[i+1][w][2] = z
else:
dp[i+1][w][0] = dp[i][w][0]
dp[i+1][w][1] = dp[i][w][1]
dp[i+1][w][2] = dp[i][w][2]
else:
dp[i+1][w][0] = dp[i][w][0]
dp[i+1][w][1] = dp[i][w][1]
dp[i+1][w][2] = dp[i][w][2]
MAX_ABS = abs(dp[N][W][0])+abs(dp[N][W][1])+abs(dp[N][W][2])
if MAX_ABS > ans: ans = MAX_ABS
#print(MAX_ABS,FGO,dp)
print(ans)
|
N,W = list(map(int,input().split()))
L = []
for i in range(N):
L.append(list(map(int,input().split())))
MAX_ANS = 0
for fgo in range(0,8):
FGO = [pow(-1,fgo%2),pow(-1,(fgo//2)%2),pow(-1,(fgo//4)%2)]
L = sorted(L,key=lambda x:x[0]*FGO[0]+x[1]*FGO[1]+x[2]*FGO[2],reverse=True)
ans = 0
for m in L[:W]:
ans += m[0]*FGO[0] + m[1]*FGO[1] + m[2]*FGO[2]
if ans > MAX_ANS: MAX_ANS = ans
print(MAX_ANS)
|
p03326
|
import itertools
[N,M]=list(map(int,input().split()
)
)
XYZ=[[int(i) for i in input().split()] for i in range(N)]
maxabs=0
for indextupl in list(itertools.permutations(list(range(N)), M)):
maxabs=max(sum([abs(sum([XYZ[i][j] for i in indextupl])) for j in range(3)]),
maxabs
)
print(maxabs)
|
[N,M]=list(map(int,input().split()
)
)
XYZ=[[int(i) for i in input().split()] for i in range(N)]
maxabs=0
for i in range(8):
pm=list(map(int,format(i, 'b')))
pm=[0,]*(3-len(pm))+pm
pm=[(-1)**item for item in pm]
newXYZ=sorted([[item[0]*pm[0],item[1]*pm[1],item[2]*pm[2]] for item in XYZ],
key=lambda x:sum(x),
reverse=True)
maxabs=max(sum([abs(sum([newXYZ[m][j] for m in range(M)]
)
) for j in range(3)
]
),
maxabs
)
print(maxabs)
|
p03326
|
import itertools
def resolve():
n,m=list(map(int,input().split()))
l=[]
for i in range(n):
x,y,z=list(map(int,input().split()))
l.append([x,y,z])
lst=list(itertools.combinations(l,m))
ms=0
for i in lst:
xx=abs(sum([p[0] for p in i]))
yy=abs(sum([p[1] for p in i]))
zz=abs(sum([p[2] for p in i]))
ms=max(ms,xx+yy+zz)
print(ms)
resolve()
|
def resolve():
ans=0
n,m=list(map(int,input().split()))
xyz=[list(map(int,input().split())) for i in range(n)]
t=[(1,1,1),(1,1,-1),(1,-1,1),(1,-1,-1),(-1,1,1),(-1,1,-1),(-1,-1,1),(-1,-1,-1)]
for k in t:
l=[k[0]*x+k[1]*y+k[2]*z for x,y,z in xyz ]
l.sort(reverse=True)
ans=max(ans,sum(l[:m]))
print(ans)
resolve()
|
p03326
|
N,M = list(map(int, input().split()))
xs,ys,zs = [], [], []
"""
sum000 +++
sum001 ++-
sum010 +-+
sum011 +--
sum100 -++
sum101 -+-
sum110 --+
sum111 ---
"""
sum000, sum001, sum010,sum011 = [], [], [], []
sum100, sum101, sum110,sum111 = [], [], [], []
sums = [[] for i in range(8)]
for i in range(N):
x,y,z = list(map(int, input().split()))
sums[0].append(x+y+z)
sums[1].append(x+y-z)
sums[2].append(x-y+z)
sums[3].append(x-y-z)
sums[4].append(-x+y+z)
sums[5].append(-x+y-z)
sums[6].append(-x-y+z)
sums[7].append(-x-y-z)
ans = 0
for s in sums:
s1 = sorted(s,reverse=False)
s2 = sorted(s,reverse=False)
x = max(abs(sum(s1[:M])),abs(sum(s2[:M])))
ans = max(ans,x)
print(ans)
|
N,M = list(map(int, input().split()))
"""
xyz
0+++
1++-
2+-+
3+--
4-++
5-+-
6--+
7---
"""
dp = [[0]*N for i in range(8)]
for i in range(N):
x,y,z = list(map(int, input().split()))
dp[0][i] = x+y+z
dp[1][i] = x+y-z
dp[2][i] = x-y+z
dp[3][i] = x-y-z
dp[4][i] = -x+y+z
dp[5][i] = -x+y-z
dp[6][i] = -x-y+z
dp[7][i] = -x-y-z
ans = 0
for i in range(8):
sums = sorted(dp[i], reverse=True)
ans = max(sum(sums[:M]),ans)
print(ans)
|
p03326
|
import itertools
N,M=list(map(int,input().split()))
x=[0 for i in range(N)]
y=[0 for i in range(N)]
z=[0 for i in range(N)]
for i in range(N):
x[i],y[i],z[i]=list(map(int,input().split()))
w=[[0 for i in range(N)] for i in range(8)]
S=list(itertools.product([-1,1],repeat=3))
def num(inp):
res=0
for i in range(3):
res+=2**i*(inp[i]+1)//2
return res
for sg in S:
for i in range(N):
w[num(sg)][i]=x[i]*sg[0]+y[i]*sg[1]+z[i]*sg[2]
tmp=[0 for i in range(8)]
for sg in S:
w[num(sg)].sort(reverse=True)
for i in range(M):
tmp[num(sg)]+=w[num(sg)][i]
print((max(tmp)))
|
import itertools
N,M=list(map(int,input().split()))
x=[0 for i in range(N)]
y=[0 for i in range(N)]
z=[0 for i in range(N)]
for i in range(N):
x[i],y[i],z[i]=list(map(int,input().split()))
S=list(itertools.product([-1,1],repeat=3))
def num(seq):
res=0
for i in range(3):
if seq[i]==1:
res+=2**i
return res
ans=0
for seq in S:
A=[seq[0]*x[i]+seq[1]*y[i]+seq[2]*z[i] for i in range(N)]
A.sort(reverse=True)
tmp=0
for i in range(M):
tmp+=A[i]
if tmp>ans:
ans=tmp
print(ans)
|
p03326
|
from itertools import combinations
def inpl(): return input().split()
n, m = list(map(int, inpl()))
M = []
for i in range(n):
M.append(list(map(int, inpl())))
cake_sets = combinations(M, m)
ans = -1
for c_set in cake_sets:
val = 0
for typ in range(3):#x, y, z
t_val = 0
for i in range(m):
t_val += c_set[i][typ]
val += abs(t_val)
ans = max(ans, val)
print(ans)
|
N, M = list(map(int, input().split()))
XYZs = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for op in range(1 << 3):
lst = []
for xyz in XYZs:
v = 0
for j in range(3):
v += xyz[j] * ((-1) ** ((op >> j) & 1))
lst.append(v)
ans = max(ans, sum(sorted(lst, reverse=True)[:M]))
print(ans)
|
p03326
|
N, M = list(map(int, input().split()))
XYZs = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for op in range(1 << 3):
lst = []
for xyz in XYZs:
v = 0
for j in range(3):
v += xyz[j] * ((-1) ** ((op >> j) & 1))
lst.append(v)
ans = max(ans, sum(sorted(lst, reverse=True)[:M]))
print(ans)
|
N, M = list(map(int, input().split()))
XYZs = [tuple(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(1 << 3):
signs = []
for j in range(3):
if i >> j & 1:
signs.append(1)
else:
signs.append(-1)
t = []
for xyz in XYZs:
x, y, z = xyz
t.append(x * signs[0] + y * signs[1] + z * signs[2])
ans = max(ans, sum(sorted(t, reverse=True)[:M]))
print(ans)
|
p03326
|
import itertools
n = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n[0])]
c = n[0]
d = n[1]
e = [0+i for i in range(c)]
f = list(itertools.combinations(e, d))
ans = []
for i in f:
x, y, z = (0, 0, 0)
for j in i:
g = a[j]
x, y, z = (x + g[0], y + g[1], z + g[2])
ans.append(sum([abs(x), abs(y), abs(z)]))
print((max(ans)))
|
n = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n[0])]
c = n[0]
d = n[1]
e = [1, -1]
f = []
for i in e:
for j in e:
for k in e:
f.append([i,j,k])
ans = []
for i in f:
g = []
for j in a:
g.append(sum([j[k]*i[k] for k in range(3)]))
g.sort()
g.reverse()
ans.append(sum(g[:d]))
print((max(ans)))
|
p03326
|
n,m = list(map(int,input().split()))
bit = [bin(i)[2:].zfill(3) for i in range(2**m)]
ans = -int(1e10)
cake = []
for i in range(n):
a,b,c = list(map(int,input().split()))
cake.append((a,b,c))
for i in range(2**m):
u = []
cond = bit[i]
for j in range(n):
cnt = 0
for k in range(3):
if cond[k] == "0":
cnt += cake[j][k]
else:
cnt -= cake[j][k]
u.append(cnt)
u.sort(reverse=True)
ans = max(ans, sum(u[:m]))
print(ans)
|
n,m = list(map(int,input().split()))
bit = [bin(i)[2:].zfill(3) for i in range(2**3)]
ans = -int(1e10)
cake = []
for i in range(n):
a,b,c = list(map(int,input().split()))
cake.append((a,b,c))
for i in range(2**3):
u = []
cond = bit[i]
for j in range(n):
cnt = 0
for k in range(3):
if cond[k] == "0":
cnt += cake[j][k]
else:
cnt -= cake[j][k]
u.append(cnt)
u.sort(reverse=True)
ans = max(ans, sum(u[:m]))
print(ans)
|
p03326
|
from itertools import product
INF = 10**18
N, M = list(map(int, input().split()))
XYZ = [list(map(int, input().split())) for _ in range(N)]
# i番目までのケーキの内、j個食べた時のpointの最大値
# (ただしpointの計算時には、8通りのmaskを乗算する)
def mul_mask(l, mask):
return [a*b for a, b in zip(l, mask)]
dp_std = [[-INF for _ in range(M+1)] for _ in range(N+1)]
for i in range(N+1):
dp_std[i][0] = 0
# print(dp_std)
max_p = -INF
for mask in product([-1, 1], repeat=3):
dp = dp_std.copy()
for i in range(1, N+1):
score = sum(mul_mask(XYZ[i-1], mask))
for j in range(1, M+1):
# print(i, j, XYZ[i-1], mask)
dp[i][j] = max(
dp[i-1][j],
dp[i-1][j-1] + score
)
# for dp_i in dp:
# print(dp_i)
p = dp[N][M]
max_p = max(max_p, p)
# print(p)
print(max_p)
|
# from itertools import product
INF = 10**18
N, M = list(map(int, input().split()))
XYZ = [list(map(int, input().split())) for _ in range(N)]
# i番目までのケーキの内、j個食べた時のpointの最大値
# (ただしpointの計算時には、8通りのmaskを乗算する)
def mul_mask(l, mask):
p = []
for i, m in enumerate(l):
p.append(m*mask[i])
# print(p)
return p
# return [a*b for a, b in zip(l, mask)]
dp_std = [[-INF for _ in range(M+1)] for _ in range(N+1)]
for i in range(N+1):
dp_std[i][0] = 0
# print(dp_std)
max_p = -INF
# masks = product([-1, 1], repeat=3)
masks = []
for i in [1, -1]:
for j in [1, -1]:
for k in [1, -1]:
masks.append([i, j, k])
# print(masks)
for mask in masks:
dp = dp_std[:]
for i in range(1, N+1):
score = sum(mul_mask(XYZ[i-1], mask))
for j in range(1, M+1):
# print(i, j, XYZ[i-1], mask)
dp[i][j] = max(
dp[i-1][j],
dp[i-1][j-1] + score
)
# for dp_i in dp:
# print(dp_i)
p = dp[N][M]
max_p = max(max_p, p)
# print(p)
print(max_p)
|
p03326
|
import itertools
def main():
# 8通りの方法を調べて最大値 -,-,- から +,+,+
N, M = list(map(int, input().split()))
data = [[0] * 8 for _ in range(M+1)]
p = list(itertools.product([-1, 1], repeat=3))
for i in range(N):
#print(data)
x, y, z = list(map(int, input().split()))
for k in range(M-1, -1, -1):
for j in range(8):
tmp = x * p[j][0] + y * p[j][1] + z * p[j][2]
if data[k+1][j] < data[k][j] + tmp:
data[k+1][j] = data[k][j] + tmp
answer = 0
for d in data[M]:
if abs(d) > answer:
answer = abs(d)
print(answer)
if __name__ == '__main__':
main()
|
import itertools
def main():
# 8通りの方法を調べて最大値 -,-,- から +,+,+
N, M = list(map(int, input().split()))
data = [[] for i in range(8)]
p = list(itertools.product([-1, 1], repeat=3))
for i in range(N):
#print(data)
x, y, z = list(map(int, input().split()))
for j in range(8):
tmp = x * p[j][0] + y * p[j][1] + z * p[j][2]
data[j].append(tmp)
answer = 0
for d in data:
d.sort(reverse=True)
s = sum(d[:M])
if abs(s) > answer:
answer = abs(s)
print(answer)
if __name__ == '__main__':
main()
|
p03326
|
# https://atcoder.jp/contests/abc100/tasks/abc100_d
from itertools import product
N, M, *XYZ = list(map(int, open(0).read().split()))
P = tuple(product((1, -1), repeat=3))
A = [[] for _ in range(8)]
for x, y, z in zip(*[iter(XYZ)] * 3):
for i, (a, b, c) in enumerate(P):
A[i].append(a * x + b * y + c * z)
cand = []
for i in range(8):
A[i].sort(reverse=True)
cand.append(sum(A[i][:M]))
print((max(cand)))
|
N, M, *XYZ = list(map(int, open(0).read().split()))
A = [[] for _ in range(8)]
for x, y, z in zip(*[iter(XYZ)] * 3):
A[0].append(sum((x, y, z)))
A[1].append(sum((x, y, -z)))
A[2].append(sum((x, -y, z)))
A[3].append(sum((x, -y, -z)))
A[4].append(sum((-x, y, z)))
A[5].append(sum((-x, y, -z)))
A[6].append(sum((-x, -y, z)))
A[7].append(sum((-x, -y, -z)))
cand = []
for i in range(8):
A[i].sort(reverse=True)
cand.append(sum(A[i][:M]))
print((max(cand)))
|
p03326
|
import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
xyz = [[int(x) for x in input().split()] for _ in range(n)]
dp = [[[0, 0, 0] for _ in range(n + 1)] for _ in range(n)]
for i in range(n):
for j in range(1, i + 2):
if i != 0:
dp[i][j] = dp[i - 1][j]
for k in range(i):
x = dp[k][j - 1][0] + xyz[i][0]
y = dp[k][j - 1][1] + xyz[i][1]
z = dp[k][j - 1][2] + xyz[i][2]
if abs(x) + abs(y) + abs(z) >= abs(dp[i][j][0]) + abs(dp[i][j][1]) + abs(dp[i][j][2]):
dp[i][j] = [x, y, z]
else:
dp[0][1] = xyz[i]
a, b, c = dp[-1][m]
print((abs(a) + abs(b) + abs(c)))
|
import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
xyz = [[int(x) for x in input().split()] for _ in range(n)]
ans = 0
for i in range(8):
i_bin = bin(i)[2:].zfill(3)
new_xyz_sum = []
for j in range(n):
tmp = 0
x, y, z = xyz[j]
if i_bin[0] == "0":
x *= -1
if i_bin[1] == "0":
y *= -1
if i_bin[2] == "0":
z *= -1
tmp = x + y + z
new_xyz_sum.append(tmp)
new_xyz_sum = sorted(new_xyz_sum, reverse=True)
ans = max(ans, sum(new_xyz_sum[:m]))
print(ans)
|
p03326
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from queue import Queue
def solve():
n, m = list(map(int, input().split()))
al = [[int(i) for i in input().split()] for _ in range(n)]
ans = 0
q = Queue()
for i in range(n):
tq = Queue()
while not q.empty():
elem = q.get()
t = [elem[0] + 1,
[
elem[1][0] + al[i][0],
elem[1][1] + al[i][1],
elem[1][2] + al[i][2]
]
]
if t[0] == m:
ans = max(ans, abs(t[1][0]) + abs(t[1][1]) + abs(t[1][2]))
else:
tq.put(t)
tq.put(elem)
q = tq
q.put([1, [al[i][0], al[i][1], al[i][2]]])
print(ans)
if __name__=="__main__":
solve()
|
n, m = list(map(int, input().split()))
l = [[int(i) for i in input().split()] for _ in [0]*n]
ans = 0
def getmm(k):
f = lambda x: (x[0] if k & 1 else -x[0]) + (x[1] if k & 2 else -x[1]) + (x[2] if k & 4 else -x[2])
al = [f(e) for e in l]
al.sort(reverse=True)
return sum(al[:m])
for i in range(8):
ans = max(ans, getmm(i))
print(ans)
|
p03326
|
N,M=list(map(int,input().split()))
L=[]
for i in range(N):
x,y,z=list(map(int,input().split()))
L.append([x,y,z])
A=[[1,1,1],[1,1,-1],[1,-1,1],[1,-1,-1],[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]
ans=-1000000000000
B=[]
for i in range(8):
for j in range(N):
B.append(A[i][0]*L[j][0]+A[i][1]*L[j][1]+A[i][2]*L[j][2])
B.sort(reverse=True)
cnt=0
for k in range(M):
cnt+=B[k]
if cnt>ans:
ans=cnt
B=[]
print(ans)
|
N,M=list(map(int,input().split()))
LPPP=[]
LPPM=[]
LPMP=[]
LPMM=[]
LMPP=[]
LMPM=[]
LMMP=[]
LMMM=[]
for i in range(N):
x,y,z=list(map(int,input().split()))
LPPP.append(x+y+z)
LPPM.append(x+y-z)
LPMP.append(x-y+z)
LPMM.append(x-y-z)
LMPP.append(-x+y+z)
LMPM.append(-x+y-z)
LMMP.append(-x-y+z)
LMMM.append(-x-y-z)
LPPP.sort(reverse=True)
LPPM.sort(reverse=True)
LPMP.sort(reverse=True)
LPMM.sort(reverse=True)
LMPP.sort(reverse=True)
LMPM.sort(reverse=True)
LMMP.sort(reverse=True)
LMMM.sort(reverse=True)
print((max(sum(LPPP[:M]),sum(LPPM[:M]),sum(LPMP[:M]),sum(LPMM[:M]),sum(LMPP[:M]),sum(LMPM[:M]),sum(LMMP[:M]),sum(LMMM[:M]))))
|
p03326
|
# -*- coding: utf-8 -*-
n,m = list(map(int, input().split()))
xyz = []
for _ in range(n):
line = list(map(int, input().split()))
xyz.append(line)
score = -1
for xo in [1,-1]:
for yo in [1,-1]:
for zo in [1,-1]:
idx = sorted(list(range(n)), reverse=True, key=lambda i:xo*xyz[i][0]+yo*xyz[i][1]+zo*xyz[i][2])
X = 0
Y = 0
Z = 0
for i in range(m):
X += xyz[idx[i]][0]
Y += xyz[idx[i]][1]
Z += xyz[idx[i]][2]
score = max(score, abs(X)+abs(Y)+abs(Z))
print(score)
|
# -*- coding: utf-8 -*-
n,m = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(n)]
res = -1
for xi in [1,-1]:
for yi in [1,-1]:
for zi in [1,-1]:
xyz.sort(reverse=True, key=lambda c:c[0]*xi+c[1]*yi+c[2]*zi)
t = [0,0,0]
for i in range(m):
t[0] += xyz[i][0]
t[1] += xyz[i][1]
t[2] += xyz[i][2]
res = max(res, abs(t[0])+abs(t[1])+abs(t[2]))
print(res)
|
p03326
|
N,M=list(map(int,input().split()))
cake=[list(map(int,input().split()))for _ in[0]*N]
dp=[[[0]*3]for _ in[0]*(M+1)]
for c in cake:
for i in range(M-1,-1,-1):
for t in dp[i]:
dp[i+1]+=[[c[i]+t[i]for i in range(3)]]
if len(dp[i])>10:
a=[sum(t)for t in dp[i]]
Max,Min=max(a),min(a)
for s,t,u in dp[i]:
if s>0 and t>0 and u>0 and s+t+u<Max:dp[i].remove([s,t,u])
if s<0 and t<0 and u<0 and s+t+u>Min:dp[i].remove([s,t,u])
print((max(sum(map(abs,x))for x in dp[M])))
|
N,M=list(map(int,input().split()))
sums=[[]for _ in[0]*8]
for _ in[0]*N:
c=list(map(int,input().split()))
for t in range(8):
sums[t]+=[sum(c[i]*[-1,1][t&(1<<i)>0]for i in range(3))]
if M:print((max(sum(sorted(sums[i])[-M:])for i in range(8))))
else:print((0))
|
p03326
|
import copy
n,m = list(map(int,input().split()))
scores = list()
for i in range(n):
score = list(map(int,input().split()))
scores.append(score)
smax=None
for i in range(n):
scores_ = copy.deepcopy(scores)
for j in range(len(scores[i])):
if scores[i][j]<0:
for k in range(n):
scores_[k][j] = -scores[k][j]
else:
for k in range(n):
scores_[k][j] = scores[k][j]
ssum=list()
for j in range(n):
ssum.append(sum(scores_[j]))
ssum.sort()
tmp=0
for j in range(m):
tmp+=ssum[-1]
ssum.pop()
if smax==None or tmp>smax:
smax=tmp
print(smax)
|
import copy
n,m = list(map(int,input().split()))
#取得
scores = list()
for i in range(n):
score = list(map(int,input().split()))
scores.append(score)
smax=None
for x in range(2):
scores_=copy.deepcopy(scores)
for i in range(n):
scores_[i][0] = pow(-1,x)*scores[i][0]
for y in range(2):
for i in range(n):
scores_[i][1] = pow(-1,y)*scores[i][1]
for z in range(2):
for i in range(n):
scores_[i][2] = pow(-1,z)*scores[i][2]
sumlist=list()
for i in range(n):
sumlist.append(sum(scores_[i]))
sumlist.sort()
tmp=0
for eat in range(m):
tmp+=sumlist[-1]
sumlist.pop()
if smax==None or tmp>smax:
smax=tmp
print(smax)
|
p03326
|
N,M=list(map(int,input().split()))
cakes=[]
for i in range(N):
x,y,z=list(map(int,input().split()))
cakes.append([x,y,z])
if M==0:
print((0))
quit()
score=[0]*8
score[0]=sum(sorted([c[0]+c[1]+c[2] for c in cakes])[-M:])
score[1]=sum(sorted([c[0]+c[1]-c[2] for c in cakes])[-M:])
score[2]=sum(sorted([c[0]-c[1]+c[2] for c in cakes])[-M:])
score[3]=sum(sorted([c[0]-c[1]-c[2] for c in cakes])[-M:])
score[4]=sum(sorted([-c[0]+c[1]+c[2] for c in cakes])[-M:])
score[5]=sum(sorted([-c[0]+c[1]-c[2] for c in cakes])[-M:])
score[6]=sum(sorted([-c[0]-c[1]+c[2] for c in cakes])[-M:])
score[7]=sum(sorted([-c[0]-c[1]-c[2] for c in cakes])[-M:])
print((max(score)))
|
N,M=list(map(int,input().split()))
cakes=[]
for i in range(N):
x,y,z=list(map(int,input().split()))
cakes.append([x,y,z])
if M==0:
print((0))
quit()
score=[0]*8
s=sorted([c[0]+c[1]+c[2] for c in cakes])
score[0]=sum(s[-M:])
score[1]=-sum(s[:M])
s=sorted([c[0]+c[1]-c[2] for c in cakes])
score[2]=sum(s[-M:])
score[3]=-sum(s[:M])
s=sorted([c[0]-c[1]+c[2] for c in cakes])
score[4]=sum(s[-M:])
score[5]=-sum(s[:M])
s=sorted([c[0]-c[1]-c[2] for c in cakes])
score[6]=sum(s[-M:])
score[7]=-sum(s[:M])
print((max(score)))
quit()
|
p03326
|
import itertools
n,m = list(map(int,input().split()))
lst = [list(map(int,input().split())) for _ in range(n)]
res = 0
for l in itertools.permutations(lst, m):
X,Y,Z = 0,0,0
for i in range(m):
x,y,z = l[i][0], l[i][1], l[i][2]
X += x
Y += y
Z += z
res = max(res, abs(X)+abs(Y)+abs(Z))
print(res)
|
n,m = list(map(int,input().split()))
lst0, lst1, lst2, lst3, lst4, lst5, lst6, lst7 =[],[],[],[],[],[],[],[]
for i in range(n):
x,y,z = list(map(int,input().split()))
lst0.append(x+y+z)
lst1.append(x+y-z)
lst2.append(x-y+z)
lst3.append(x-y-z)
lst4.append(-x+y+z)
lst5.append(-x+y-z)
lst6.append(-x-y+z)
lst7.append(-x-y-z)
lst0.sort(reverse=True)
lst1.sort(reverse=True)
lst2.sort(reverse=True)
lst3.sort(reverse=True)
lst4.sort(reverse=True)
lst5.sort(reverse=True)
lst6.sort(reverse=True)
lst7.sort(reverse=True)
res = []
res.append(sum(lst0[:m]))
res.append(sum(lst1[:m]))
res.append(sum(lst2[:m]))
res.append(sum(lst3[:m]))
res.append(sum(lst4[:m]))
res.append(sum(lst5[:m]))
res.append(sum(lst6[:m]))
res.append(sum(lst7[:m]))
print((max(res)))
|
p03326
|
n,m = list(map(int,input().split()))
lst0, lst1, lst2, lst3, lst4, lst5, lst6, lst7 =[],[],[],[],[],[],[],[]
for i in range(n):
x,y,z = list(map(int,input().split()))
lst0.append(x+y+z)
lst1.append(x+y-z)
lst2.append(x-y+z)
lst3.append(x-y-z)
lst4.append(-x+y+z)
lst5.append(-x+y-z)
lst6.append(-x-y+z)
lst7.append(-x-y-z)
lst0.sort(reverse=True)
lst1.sort(reverse=True)
lst2.sort(reverse=True)
lst3.sort(reverse=True)
lst4.sort(reverse=True)
lst5.sort(reverse=True)
lst6.sort(reverse=True)
lst7.sort(reverse=True)
res = []
res.append(sum(lst0[:m]))
res.append(sum(lst1[:m]))
res.append(sum(lst2[:m]))
res.append(sum(lst3[:m]))
res.append(sum(lst4[:m]))
res.append(sum(lst5[:m]))
res.append(sum(lst6[:m]))
res.append(sum(lst7[:m]))
print((max(res)))
|
n,m = list(map(int,input().split()))
lst = [[] for _ in range(8)]
for i in range(n):
x,y,z = list(map(int,input().split()))
lst[0].append(x+y+z)
lst[1].append(x+y-z)
lst[2].append(x-y+z)
lst[3].append(x-y-z)
lst[4].append(-x+y+z)
lst[5].append(-x+y-z)
lst[6].append(-x-y+z)
lst[7].append(-x-y-z)
for i in range(8):
lst[i].sort(reverse=True)
res = []
for i in range(8):
res.append(sum(lst[i][:m]))
print((max(res)))
|
p03326
|
N, M = list(map(int, input().split()))
XYZ = [list(map(int, input().split())) for i in range(N)]
X = [XYZ[i][0] for i in range(N)]
Y = [XYZ[i][1] for i in range(N)]
Z = [XYZ[i][2] for i in range(N)]
ans = 0
for i in range(2**M - 1, 2**N - 2**(N - M) + 1):
b = bin(i)[2:]
if len(b) != N:
f = [0 for i in range(N-len(b))] + [int(a) for a in b]
else:
f = [int(a) for a in b]
if sum(f) == M:
ans_x = abs(sum([x * y for x, y in zip(X, f)]))
ans_y = abs(sum([x * y for x, y in zip(Y, f)]))
ans_z = abs(sum([x * y for x, y in zip(Z, f)]))
ans = max(ans, (ans_x + ans_y + ans_z))
print(ans)
|
N, M = list(map(int, input().split()))
cakes = []
for i in range(N):
x, y, z = list(map(int, input().split()))
cakes.append([x, y, z])
if M == 0:
print((0))
quit()
score = [0]*8
s = sorted([c[0]+c[1]+c[2] for c in cakes])
score[0] = sum(s[-M:])
score[1] = -sum(s[:M])
s = sorted([c[0]+c[1]-c[2] for c in cakes])
score[2] = sum(s[-M:])
score[3] = -sum(s[:M])
s = sorted([c[0]-c[1]+c[2] for c in cakes])
score[4] = sum(s[-M:])
score[5] = -sum(s[:M])
s = sorted([c[0]-c[1]-c[2] for c in cakes])
score[6] = sum(s[-M:])
score[7] = -sum(s[:M])
print((max(score)))
|
p03326
|
import itertools
n, m = list(map(int, (input().split())))
scores = [list(map(int,input().split())) for _ in range(n) ]
max_socre = 0
for cakes in itertools.combinations(scores, m):
b = 0
t = 0
p = 0
for cake in cakes:
b += cake[0]
t += cake[1]
p += cake[2]
score = abs(b) + abs(t) + abs(p)
if score > max_socre:
max_socre = score
print(max_socre)
|
import itertools
n, m = list(map(int, (input().split())))
scores = [list(map(int,input().split())) for _ in range(n) ]
# 8 pattern
max_of_sum = 0
for pick in range(8):
sum_scores = []
for score in scores:
sum_of_score = 0
if pick & 0b001 == 0:
# plus
sum_of_score += score[0]
else:
sum_of_score -= score[0]
if pick & 0b010 == 0:
# plus
sum_of_score += score[1]
else:
sum_of_score -= score[1]
if pick & 0b100 == 0:
# plus
sum_of_score += score[2]
else:
sum_of_score -= score[2]
sum_scores.append(sum_of_score)
sum_scores.sort(reverse=True)
current_sum = sum(sum_scores[:m])
if current_sum > max_of_sum:
max_of_sum = current_sum
print(max_of_sum)
|
p03326
|
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N, M = list(map(int, input().split()))
X, Y, Z = [0] * N, [0] * N, [0] * N
for i in range(N):
X[i], Y[i], Z[i] = list(map(int, input().split()))
codes = [[1, 1, 1], [1, 1, -1], [1, -1, 1], [1, -1, -1], [-1, 1, 1], [-1, 1, -1], [-1, -1, 1], [-1, -1, -1]]
def calc(code, idx):
return code[0] * X[idx] + code[1] * Y[idx] + code[2] * Z[idx]
ans = 0
INF = 1 << 60
for code in codes:
dp = [-INF] * (M + 1)
dp[0] = 0
for i in range(N):
tmp = [-INF] * (M + 1)
tmp[0] = 0
for j in range(M, 0, -1):
if dp[j - 1] >= 0:
tmp[j] = max(dp[j], dp[j - 1] + calc(code, i))
dp = tmp
# print("", dp)
# print(dp)
ans = max(ans, dp[M])
print(ans)
|
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N, M = list(map(int, input().split()))
X, Y, Z = [0] * N, [0] * N, [0] * N
for i in range(N):
X[i], Y[i], Z[i] = list(map(int, input().split()))
codes = [[1, 1, 1], [1, 1, -1], [1, -1, 1], [1, -1, -1], [-1, 1, 1], [-1, 1, -1], [-1, -1, 1], [-1, -1, -1]]
def calc(code, idx):
return code[0] * X[idx] + code[1] * Y[idx] + code[2] * Z[idx]
INF = 1 << 60
ans = -INF
for code in codes:
ar = [0] * N
for i in range(N):
ar[i] = calc(code, i)
ar.sort(reverse=True)
ans = max(ans, sum(ar[:M]))
print(ans)
|
p03326
|
n,m = list(map(int,input().split()))
xyz = [list(map(int,input().split())) for i in range(n)]
dp = [[[[0,0,0] for k in range(8)] for j in range(n+1)] for i in range(n+1)]
for i in range(n):
for j in range(1,i+2):
for k in range(8):
l,r = 0,0
for d in range(3):
if k>>d&1:
l += dp[i][j-1][k][d] + xyz[i][d]
r += dp[i][j][k][d]
else:
l -= dp[i][j-1][k][d] + xyz[i][d]
r -= dp[i][j][k][d]
if l > r:
for d in range(3):
dp[i+1][j][k][d] = dp[i][j-1][k][d] + xyz[i][d]
else:
dp[i+1][j][k] = dp[i][j][k]
ans = 0
for k in range(8):
a = 0
for d in range(3):
if k>>d&1:
a += dp[n][m][k][d]
else:
a -= dp[n][m][k][d]
ans = max(ans,a)
print(ans)
|
n,m = list(map(int,input().split()))
xyz = [list(map(int,input().split())) for i in range(n)]
ans = 0
for i in range(8):
s = []
for j in range(n):
a = 0
for k in range(3):
if i>>k&1:
a += xyz[j][k]
else:
a -= xyz[j][k]
s.append(a)
s.sort()
ans = max(ans,sum(s[n-m:]))
print(ans)
|
p03326
|
N,M = list(map(int,input().split()))
XYZ = [tuple(map(int,input().split())) for _ in range(N)]
ans = 0
for b in range(8):
dp = [0]
for x,y,z in XYZ:
if b&1: x *= -1
if b&2: y *= -1
if b&4: z *= -1
v = x+y+z
dp2 = dp[:]
for i in range(len(dp)-1,-1,-1):
if i < M:
if i+1 >= len(dp2):
dp2.append(dp[i] + v)
else:
dp2[i+1] = max(dp2[i+1], dp[i] + v)
dp = dp2
ans = max(ans, dp[-1])
print(ans)
|
N,M = list(map(int,input().split()))
XYZ = [tuple(map(int,input().split())) for _ in range(N)]
ans = 0
for b in range(8):
arr = []
for x,y,z in XYZ:
if b&1: x *= -1
if b&2: y *= -1
if b&4: z *= -1
arr.append(x+y+z)
arr.sort(reverse=True)
ans = max(ans, sum(arr[:M]))
print(ans)
|
p03326
|
# -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(n)]
ans = 0
dp = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]+A[i-1][0]+A[i-1][1]+A[i-1][2])
ans = max(ans, dp[n][m])
dp = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]+A[i-1][0]+A[i-1][1]-A[i-1][2])
ans = max(ans, dp[n][m])
dp = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]+A[i-1][0]-A[i-1][1]+A[i-1][2])
ans = max(ans, dp[n][m])
dp = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]+A[i-1][0]-A[i-1][1]-A[i-1][2])
ans = max(ans, dp[n][m])
dp = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]-A[i-1][0]+A[i-1][1]+A[i-1][2])
ans = max(ans, dp[n][m])
dp = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]-A[i-1][0]+A[i-1][1]-A[i-1][2])
ans = max(ans, dp[n][m])
dp = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]-A[i-1][0]-A[i-1][1]+A[i-1][2])
ans = max(ans, dp[n][m])
dp = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]-A[i-1][0]-A[i-1][1]-A[i-1][2])
ans = max(ans, dp[n][m])
print(ans)
|
# -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(8):
value_list = []
for a in A:
value_list.append((2*(i&1)-1)*a[0] + (2*((i>>1)&1)-1)*a[1] + (2*((i>>2)&1)-1)*a[2])
value_list.sort(reverse=True)
ans = max(ans, sum(value_list[:m]))
print(ans)
|
p03326
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.