Submission #31064738

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] = map(int, input().split())
for cx in range(0, 101):
    for cy in range(0, 101):
        # 中心の座標を決めると中心の高さが復元できる
        ch = 0
        for i in range(n):
            if h[i] > 0: # 高さが 0 の地点の情報からは復元できない
                ch = h[i] + abs(x[i] - cx) + abs(y[i] - cy)
                break
        for i in range(n):
            if max(ch - abs(x[i] - cx) - abs(y[i] - cy), 0) != h[i]:
                break
            if i == n - 1:
                print(cx, cy, ch)

Submission Info

Submission Time
Task C - Pyramid
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 300
Code Size 654 Byte
Status AC
Exec Time 93 ms
Memory 74116 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 23
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 83 ms 73672 KiB
in02.txt AC 78 ms 73988 KiB
in03.txt AC 84 ms 73852 KiB
in04.txt AC 85 ms 73932 KiB
in05.txt AC 83 ms 73712 KiB
in06.txt AC 93 ms 73824 KiB
in07.txt AC 64 ms 69208 KiB
in08.txt AC 83 ms 73840 KiB
in09.txt AC 82 ms 73732 KiB
in10.txt AC 77 ms 73688 KiB
in11.txt AC 81 ms 74084 KiB
in12.txt AC 80 ms 73400 KiB
in13.txt AC 89 ms 74116 KiB
in14.txt AC 85 ms 73924 KiB
in15.txt AC 76 ms 73212 KiB
in16.txt AC 83 ms 73692 KiB
in17.txt AC 75 ms 73576 KiB
in18.txt AC 80 ms 73644 KiB
in19.txt AC 88 ms 73816 KiB
in20.txt AC 64 ms 68588 KiB
s1.txt AC 64 ms 71272 KiB
s2.txt AC 63 ms 69100 KiB
s3.txt AC 64 ms 70736 KiB