Submission #3788206
Source Code Expand
N=int(input()) z=[] for i in range(N): z.append(list(map(int,input().split()))) h=max(zz[2] for zz in z) while(1): flag=1 for x in range(101): for y in range(101): for zz in z: if max(h-abs(zz[0]-x)-abs(zz[1]-y),0) != zz[2]: break else: print(x,y,h) exit() h+=1
Submission Info
Submission Time | |
---|---|
Task | C - Pyramid |
User | usto |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 392 Byte |
Status | AC |
Exec Time | 665 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 | 18 ms | 3064 KB |
in02.txt | AC | 94 ms | 3060 KB |
in03.txt | AC | 109 ms | 3064 KB |
in04.txt | AC | 255 ms | 3064 KB |
in05.txt | AC | 170 ms | 3060 KB |
in06.txt | AC | 209 ms | 3064 KB |
in07.txt | AC | 665 ms | 3060 KB |
in08.txt | AC | 247 ms | 3060 KB |
in09.txt | AC | 22 ms | 3064 KB |
in10.txt | AC | 26 ms | 3060 KB |
in11.txt | AC | 36 ms | 3060 KB |
in12.txt | AC | 21 ms | 3060 KB |
in13.txt | AC | 59 ms | 3060 KB |
in14.txt | AC | 83 ms | 2940 KB |
in15.txt | AC | 121 ms | 2940 KB |
in16.txt | AC | 41 ms | 3060 KB |
in17.txt | AC | 79 ms | 3060 KB |
in18.txt | AC | 34 ms | 3064 KB |
in19.txt | AC | 42 ms | 3064 KB |
in20.txt | AC | 26 ms | 3060 KB |
s1.txt | AC | 25 ms | 3064 KB |
s2.txt | AC | 18 ms | 3060 KB |
s3.txt | AC | 30 ms | 2940 KB |