結果
問題 | No.1640 簡単な色塗り |
ユーザー | 👑 obakyan |
提出日時 | 2021-11-23 22:56:22 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 390 ms / 2,000 ms |
コード長 | 2,189 bytes |
コンパイル時間 | 206 ms |
コンパイル使用メモリ | 5,328 KB |
実行使用メモリ | 46,640 KB |
最終ジャッジ日時 | 2023-09-08 03:33:32 |
合計ジャッジ時間 | 17,370 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 252 ms
46,640 KB |
testcase_05 | AC | 270 ms
39,784 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 228 ms
24,880 KB |
testcase_11 | AC | 163 ms
21,408 KB |
testcase_12 | AC | 154 ms
20,192 KB |
testcase_13 | AC | 376 ms
39,788 KB |
testcase_14 | AC | 359 ms
39,012 KB |
testcase_15 | AC | 95 ms
14,408 KB |
testcase_16 | AC | 127 ms
18,496 KB |
testcase_17 | AC | 289 ms
32,740 KB |
testcase_18 | AC | 19 ms
4,740 KB |
testcase_19 | AC | 137 ms
20,076 KB |
testcase_20 | AC | 200 ms
24,656 KB |
testcase_21 | AC | 167 ms
21,032 KB |
testcase_22 | AC | 14 ms
4,376 KB |
testcase_23 | AC | 229 ms
26,184 KB |
testcase_24 | AC | 53 ms
9,508 KB |
testcase_25 | AC | 140 ms
19,772 KB |
testcase_26 | AC | 257 ms
30,800 KB |
testcase_27 | AC | 85 ms
13,624 KB |
testcase_28 | AC | 341 ms
38,012 KB |
testcase_29 | AC | 262 ms
29,528 KB |
testcase_30 | AC | 21 ms
6,216 KB |
testcase_31 | AC | 175 ms
29,100 KB |
testcase_32 | AC | 155 ms
26,652 KB |
testcase_33 | AC | 97 ms
17,284 KB |
testcase_34 | AC | 127 ms
24,192 KB |
testcase_35 | AC | 96 ms
17,308 KB |
testcase_36 | AC | 19 ms
6,392 KB |
testcase_37 | AC | 31 ms
8,208 KB |
testcase_38 | AC | 157 ms
26,944 KB |
testcase_39 | AC | 58 ms
13,480 KB |
testcase_40 | AC | 62 ms
13,808 KB |
testcase_41 | AC | 131 ms
24,072 KB |
testcase_42 | AC | 75 ms
14,452 KB |
testcase_43 | AC | 74 ms
15,044 KB |
testcase_44 | AC | 74 ms
14,484 KB |
testcase_45 | AC | 52 ms
12,408 KB |
testcase_46 | AC | 24 ms
7,400 KB |
testcase_47 | AC | 15 ms
5,464 KB |
testcase_48 | AC | 161 ms
27,272 KB |
testcase_49 | AC | 7 ms
4,380 KB |
testcase_50 | AC | 1 ms
4,380 KB |
testcase_51 | AC | 1 ms
4,376 KB |
testcase_52 | AC | 378 ms
41,080 KB |
testcase_53 | AC | 390 ms
41,044 KB |
07_evil_01.txt | AC | 966 ms
84,100 KB |
07_evil_02.txt | AC | 1,525 ms
129,144 KB |
ソースコード
local n = io.read("*n") local parent = {} for i = 1, n do parent[i] = i end local function uf_findroot(idx) local idx_update = idx while parent[idx] ~= idx do idx = parent[idx] end while parent[idx_update] ~= idx do parent[idx_update], idx_update = idx, parent[idx_update] end return idx end local as, bs = {}, {} for i = 1, n do local a, b = io.read("*n", "*n") as[i], bs[i] = a, b local ra, rb = uf_findroot(a), uf_findroot(b) parent[b], parent[rb] = ra, ra end local group = {} local g_e = {} local edge = {} local edgecnt = {} for i = 1, n do group[i] = {} g_e[i] = {} edge[i] = {} edgecnt[i] = 0 end for i = 1, n do local r = uf_findroot(i) table.insert(group[r], i) end for i = 1, n do local a, b = as[i], bs[i] local r = uf_findroot(a) table.insert(g_e[r], i) edge[a][i], edge[b][i] = true, true edgecnt[a] = edgecnt[a] + 1 if a ~= b then edgecnt[b] = edgecnt[b] + 1 end end for i = 1, n do if #group[i] ~= #g_e[i] then print("No") os.exit() end end print("Yes") local ans = {} for i = 1, n do ans[i] = 0 end local function solve(gi) local tasks = {} local done = 0 for i = 1, #group[gi] do local src = group[gi][i] if edgecnt[src] == 1 then table.insert(tasks, src) end end while done < #tasks do done = done + 1 local src = tasks[done] local ei = next(edge[src]) ans[ei] = src local dst = as[ei] == src and bs[ei] or as[ei] edge[dst][ei] = nil edgecnt[dst] = edgecnt[dst] - 1 if edgecnt[dst] == 1 then table.insert(tasks, dst) end end if done == #group[gi] then return end local ring_spos = false for i = 1, #group[gi] do local src = group[gi][i] if edgecnt[src] == 2 then ring_spos = src table.insert(tasks, src) break end end while done < #tasks do done = done + 1 local src = tasks[done] local ei = next(edge[src]) ans[ei] = src local dst = as[ei] == src and bs[ei] or as[ei] edge[dst][ei] = nil edgecnt[dst] = edgecnt[dst] - 1 if edgecnt[dst] == 1 then table.insert(tasks, dst) end end end for i = 1, n do solve(i) end print(table.concat(ans, "\n"))