Submission #1800024
Source Code Expand
N = int(input()) cards = [] for i in range(N): cards.append(list(map(int,input().split()))) points = [] for i in range(N): points.append(0) for i in range(3): for j in range(N): flag = 0 for k in range(j): if cards[j][i] == cards[k][i]: flag = 1 break if j+1<N: for k in range(j+1,N): if cards[j][i] == cards[k][i]: flag = 1 break if flag==0: points[j] += cards[j][i] for i in range(N): print(points[i])
Submission Info
Submission Time | |
---|---|
Task | B - Sum of Three Integers |
User | compass |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 472 Byte |
Status | RE |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | RE | 17 ms | 3064 KB |
sample_02.txt | RE | 17 ms | 3064 KB |
subtask_1_01.txt | RE | 17 ms | 3064 KB |
subtask_1_02.txt | RE | 17 ms | 3064 KB |
subtask_1_03.txt | RE | 17 ms | 3064 KB |
subtask_1_04.txt | RE | 17 ms | 3064 KB |
subtask_1_05.txt | RE | 17 ms | 3064 KB |
subtask_1_06.txt | RE | 17 ms | 3064 KB |
subtask_1_07.txt | RE | 17 ms | 3064 KB |
subtask_1_08.txt | RE | 17 ms | 3064 KB |