Submission #2691966
Source Code Expand
n, m = 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)
Submission Info
Submission Time | |
---|---|
Task | D - Patisserie ABC |
User | yumechi |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 352 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 3300 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 26 ms | 3292 KB |
in02.txt | AC | 26 ms | 3284 KB |
in03.txt | AC | 26 ms | 3288 KB |
in04.txt | AC | 26 ms | 3292 KB |
in05.txt | AC | 26 ms | 3284 KB |
in06.txt | AC | 26 ms | 3292 KB |
in07.txt | AC | 26 ms | 3288 KB |
in08.txt | AC | 23 ms | 3064 KB |
in09.txt | AC | 23 ms | 3060 KB |
in10.txt | AC | 23 ms | 3064 KB |
in11.txt | AC | 24 ms | 3284 KB |
in12.txt | AC | 24 ms | 3300 KB |
in13.txt | AC | 23 ms | 3188 KB |
in14.txt | AC | 23 ms | 3188 KB |
in15.txt | AC | 24 ms | 3188 KB |
in16.txt | AC | 23 ms | 3188 KB |
sample_01.txt | AC | 17 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 17 ms | 3060 KB |
sample_04.txt | AC | 17 ms | 3064 KB |