結果

問題 No.277 根掘り葉掘り
ユーザー 👑 obakyanobakyan
提出日時 2019-06-03 09:16:42
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 168 ms / 3,000 ms
コード長 1,140 bytes
コンパイル時間 201 ms
コンパイル使用メモリ 7,068 KB
実行使用メモリ 19,584 KB
最終ジャッジ日時 2024-09-17 20:20:49
合計ジャッジ時間 3,480 ms
ジャッジサーバーID
(参考情報)
judge6 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

local n = io.read("*n")
local t = {}
local fromroot = {}
local fromleaf = {}
for i = 1, n do
t[i] = {}
fromroot[i] = -1
fromleaf[i] = -1
end
for i = 1, n - 1 do
local a, b = io.read("*n", "*n")
table.insert(t[a], b)
table.insert(t[b], a)
end
local tasks = {1}
local tasknum, done = 1, 0
fromroot[1] = 0
while done < tasknum do
done = done + 1
local curidx = tasks[done]
for i = 1, #t[curidx] do
local nextidx = t[curidx][i]
if fromroot[nextidx] == -1 then
fromroot[nextidx] = fromroot[curidx] + 1
tasknum = tasknum + 1
table.insert(tasks, nextidx)
end
end
end
tasks = {}
tasknum, done = 0, 0
for i = 1, n do
if #t[i] == 1 then
tasknum = tasknum + 1
table.insert(tasks, i)
fromleaf[i] = 0
end
end
while done < tasknum do
done = done + 1
local curidx = tasks[done]
for i = 1, #t[curidx] do
local nextidx = t[curidx][i]
if fromleaf[nextidx] == -1 then
fromleaf[nextidx] = fromleaf[curidx] + 1
tasknum = tasknum + 1
table.insert(tasks, nextidx)
end
end
end
local mmi = math.min
for i = 1, n do
print(mmi(fromroot[i], fromleaf[i]))
end
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0