Submission #3345654

Source Code Expand

Copy
N = gets.to_i
xs, ys, hs = [], [], []
N.times do |i|
    xs[i], ys[i], hs[i] = gets.split.map(&:to_i)
end

(0..100).each do |x|
    (0..100).each do |y|
        h = nil
        hmax = 10**10
        success = true
        N.times do |i|
            dist = (xs[i]-x).abs + (ys[i]-y).abs
            if hs[i] == 0
                hmax = dist if hmax > dist
            else
                hc = hs[i] + dist
                if h && h != hc
                    success = false
                    break
                else
                    h = hc
                end
            end
        end
        if success && h <= hmax
            puts [x, y, h].join(' ')
            exit
        end
    end
end

Submission Info

Submission Time
Task C - Pyramid
User betrue12
Language Ruby (2.3.3)
Score 300
Code Size 735 Byte
Status
Exec Time 198 ms
Memory 1788 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt
All 300 / 300 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 7 ms 1788 KB
in02.txt 12 ms 1788 KB
in03.txt 14 ms 1788 KB
in04.txt 13 ms 1788 KB
in05.txt 9 ms 1788 KB
in06.txt 14 ms 1788 KB
in07.txt 11 ms 1788 KB
in08.txt 8 ms 1788 KB
in09.txt 11 ms 1788 KB
in10.txt 8 ms 1788 KB
in11.txt 13 ms 1788 KB
in12.txt 10 ms 1788 KB
in13.txt 10 ms 1788 KB
in14.txt 15 ms 1788 KB
in15.txt 15 ms 1788 KB
in16.txt 12 ms 1788 KB
in17.txt 14 ms 1788 KB
in18.txt 12 ms 1788 KB
in19.txt 15 ms 1788 KB
in20.txt 198 ms 1788 KB
s1.txt 7 ms 1788 KB
s2.txt 7 ms 1788 KB
s3.txt 15 ms 1788 KB