Submission #3788355


Source Code Expand

N = int(input())
x = [0] * N
y = [0] * N
h = [0] * N

for i in range(N):
    x[i], y[i], h[i] = list(map(int, input().split()))

for i in range(101):
    for j in range(101):
        for k in range(N):
            H = h[k] + abs(x[k]-i) + abs(y[k]-j)
            if H < 1:
                continue
            flg = True
            for l in range(N):
                if max (H-abs(x[l]-i)-abs(y[l]-j),0) != h[l] :
                    flg = False
                    break
            if flg:
                print("{} {} {}".format(i,j,H))
                exit()

Submission Info

Submission Time
Task C - Pyramid
User arbol962
Language Python (3.4.3)
Score 0
Code Size 584 Byte
Status TLE
Exec Time 3156 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 22
TLE × 1
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 56 ms 3064 KB
in03.txt AC 59 ms 3064 KB
in04.txt AC 59 ms 3064 KB
in05.txt AC 34 ms 3064 KB
in06.txt AC 83 ms 3064 KB
in07.txt AC 50 ms 3064 KB
in08.txt AC 28 ms 3064 KB
in09.txt AC 49 ms 3064 KB
in10.txt AC 82 ms 3064 KB
in11.txt AC 701 ms 3064 KB
in12.txt AC 437 ms 3064 KB
in13.txt AC 481 ms 3064 KB
in14.txt AC 960 ms 3064 KB
in15.txt AC 1506 ms 3064 KB
in16.txt AC 854 ms 3064 KB
in17.txt AC 905 ms 3064 KB
in18.txt AC 681 ms 3064 KB
in19.txt AC 1220 ms 3064 KB
in20.txt TLE 3156 ms 3064 KB
s1.txt AC 20 ms 3064 KB
s2.txt AC 18 ms 3064 KB
s3.txt AC 69 ms 3064 KB