Submission #3789862
Source Code Expand
N=int(input()) A=[] for i in range(N): x,y,h=map(int,input().split()) A.append([h,x,y]) A.sort(reverse=True) for i in range(101): for j in range(101): for k in range(N): H = A[k][0] + abs(j-A[k][1]) + abs(i-A[k][2]) flg = True for l in A: if l[0]!=max(0,H-abs(j-l[1])-abs(i-l[2])): flg = False break if flg == True: print(j,i,H) exit()
Submission Info
Submission Time | |
---|---|
Task | C - Pyramid |
User | arbol962 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 512 Byte |
Status | AC |
Exec Time | 1253 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.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, in17.txt, in18.txt, in19.txt, in20.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 17 ms | 3064 KB |
in02.txt | AC | 47 ms | 3064 KB |
in03.txt | AC | 63 ms | 3064 KB |
in04.txt | AC | 59 ms | 3064 KB |
in05.txt | AC | 56 ms | 3064 KB |
in06.txt | AC | 53 ms | 3064 KB |
in07.txt | AC | 45 ms | 3064 KB |
in08.txt | AC | 52 ms | 3064 KB |
in09.txt | AC | 78 ms | 3064 KB |
in10.txt | AC | 140 ms | 3064 KB |
in11.txt | AC | 466 ms | 3064 KB |
in12.txt | AC | 522 ms | 3064 KB |
in13.txt | AC | 1005 ms | 3064 KB |
in14.txt | AC | 145 ms | 3064 KB |
in15.txt | AC | 1253 ms | 3064 KB |
in16.txt | AC | 448 ms | 3064 KB |
in17.txt | AC | 436 ms | 3064 KB |
in18.txt | AC | 832 ms | 3064 KB |
in19.txt | AC | 86 ms | 3064 KB |
in20.txt | AC | 1117 ms | 3064 KB |
s1.txt | AC | 19 ms | 3064 KB |
s2.txt | AC | 18 ms | 3064 KB |
s3.txt | AC | 18 ms | 3064 KB |