結果
問題 | No.1382 Travel in Mitaru city |
ユーザー | 👑 obakyan |
提出日時 | 2021-03-07 23:14:21 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 215 ms / 2,000 ms |
コード長 | 2,049 bytes |
コンパイル時間 | 241 ms |
コンパイル使用メモリ | 5,456 KB |
実行使用メモリ | 14,168 KB |
最終ジャッジ日時 | 2023-07-30 14:09:50 |
合計ジャッジ時間 | 12,747 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,508 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 73 ms
5,684 KB |
testcase_07 | AC | 55 ms
4,932 KB |
testcase_08 | AC | 33 ms
4,384 KB |
testcase_09 | AC | 76 ms
5,984 KB |
testcase_10 | AC | 72 ms
5,724 KB |
testcase_11 | AC | 129 ms
8,904 KB |
testcase_12 | AC | 134 ms
9,136 KB |
testcase_13 | AC | 142 ms
9,324 KB |
testcase_14 | AC | 117 ms
8,508 KB |
testcase_15 | AC | 127 ms
8,892 KB |
testcase_16 | AC | 206 ms
13,092 KB |
testcase_17 | AC | 203 ms
13,064 KB |
testcase_18 | AC | 208 ms
13,132 KB |
testcase_19 | AC | 204 ms
13,064 KB |
testcase_20 | AC | 213 ms
13,204 KB |
testcase_21 | AC | 215 ms
13,144 KB |
testcase_22 | AC | 214 ms
13,272 KB |
testcase_23 | AC | 211 ms
13,136 KB |
testcase_24 | AC | 211 ms
12,928 KB |
testcase_25 | AC | 210 ms
12,960 KB |
testcase_26 | AC | 181 ms
13,072 KB |
testcase_27 | AC | 184 ms
13,088 KB |
testcase_28 | AC | 196 ms
13,500 KB |
testcase_29 | AC | 175 ms
12,972 KB |
testcase_30 | AC | 171 ms
13,104 KB |
testcase_31 | AC | 104 ms
11,244 KB |
testcase_32 | AC | 132 ms
12,372 KB |
testcase_33 | AC | 117 ms
11,752 KB |
testcase_34 | AC | 87 ms
8,236 KB |
testcase_35 | AC | 52 ms
6,968 KB |
testcase_36 | AC | 83 ms
11,224 KB |
testcase_37 | AC | 14 ms
4,380 KB |
testcase_38 | AC | 88 ms
11,900 KB |
testcase_39 | AC | 24 ms
4,876 KB |
testcase_40 | AC | 67 ms
10,216 KB |
testcase_41 | AC | 78 ms
10,840 KB |
testcase_42 | AC | 91 ms
12,068 KB |
testcase_43 | AC | 90 ms
11,104 KB |
testcase_44 | AC | 32 ms
5,436 KB |
testcase_45 | AC | 84 ms
10,644 KB |
testcase_46 | AC | 45 ms
5,440 KB |
testcase_47 | AC | 182 ms
13,532 KB |
testcase_48 | AC | 121 ms
9,220 KB |
testcase_49 | AC | 195 ms
14,168 KB |
testcase_50 | AC | 81 ms
8,168 KB |
testcase_51 | AC | 107 ms
11,376 KB |
testcase_52 | AC | 136 ms
12,440 KB |
testcase_53 | AC | 27 ms
4,752 KB |
testcase_54 | AC | 56 ms
7,052 KB |
testcase_55 | AC | 126 ms
12,016 KB |
testcase_56 | AC | 38 ms
6,168 KB |
testcase_57 | AC | 79 ms
8,416 KB |
testcase_58 | AC | 13 ms
4,380 KB |
testcase_59 | AC | 36 ms
5,400 KB |
testcase_60 | AC | 121 ms
11,896 KB |
testcase_61 | AC | 5 ms
4,376 KB |
testcase_62 | AC | 2 ms
4,384 KB |
testcase_63 | AC | 19 ms
4,380 KB |
testcase_64 | AC | 6 ms
4,376 KB |
testcase_65 | AC | 3 ms
4,380 KB |
testcase_66 | AC | 5 ms
4,508 KB |
testcase_67 | AC | 6 ms
4,380 KB |
testcase_68 | AC | 9 ms
4,380 KB |
testcase_69 | AC | 4 ms
4,376 KB |
testcase_70 | AC | 11 ms
4,376 KB |
ソースコード
local bls, brs = bit.lshift, bit.rshift local Heapq = {} Heapq.create = function(self, lt) self.lt = lt self.cnt = 0 self.t = {} end Heapq.push = function(self, v) local hqlt = self.lt local hqt = self.t local c = self.cnt + 1 self.cnt = c hqt[c] = v while 1 < c do local p = brs(c, 1) if hqlt(hqt[c], hqt[p]) then hqt[c], hqt[p] = hqt[p], hqt[c] c = p else break end end end Heapq.empty = function(self) return self.cnt == 0 end Heapq.pop = function(self) local hqlt = self.lt local hqt = self.t local ret = hqt[1] local c = self.cnt hqt[1] = hqt[c] c = c - 1 self.cnt = c local p = 1 while true do local d1, d2 = p * 2, p * 2 + 1 if c < d1 then break elseif c < d2 then if hqlt(hqt[d1], hqt[p]) then hqt[d1], hqt[p] = hqt[p], hqt[d1] end break else if hqlt(hqt[d1], hqt[d2]) then if hqlt(hqt[d1], hqt[p]) then hqt[d1], hqt[p] = hqt[p], hqt[d1] p = d1 else break end else if hqlt(hqt[d2], hqt[p]) then hqt[d2], hqt[p] = hqt[p], hqt[d2] p = d2 else break end end end end return ret end Heapq.new = function(lt) local obj = {} setmetatable(obj, {__index = Heapq}) obj:create(lt) return obj end local n, m = io.read("*n", "*n") local spos, tpos = io.read("*n", "*n") local p = {} local edge = {} local asked = {} for i = 1, n do p[i] = io.read("*n") edge[i] = {} asked[i] = false end for i = 1, m do local a, b = io.read("*n", "*n") table.insert(edge[a], b) table.insert(edge[b], a) end local function hqlt(a, b) return p[a] > p[b] end local hq = Heapq.new(hqlt) asked[spos] = true hq:push(spos) local ret = 0 local curval = p[spos] while not hq:empty() do local v = hq:pop() if p[v] < curval then ret = ret + 1 curval = p[v] end for i = 1, #edge[v] do local dst = edge[v][i] if not asked[dst] then asked[dst] = true hq:push(dst) end end end print(ret)