結果

問題 No.1170 Never Want to Walk
ユーザー 👑 obakyanobakyan
提出日時 2021-06-14 08:41:05
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 546 ms / 2,000 ms
コード長 4,444 bytes
コンパイル時間 353 ms
コンパイル使用メモリ 5,300 KB
実行使用メモリ 39,000 KB
最終ジャッジ日時 2023-08-25 18:02:21
合計ジャッジ時間 10,710 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,384 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 1 ms
4,384 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 1 ms
4,380 KB
testcase_12 AC 6 ms
4,376 KB
testcase_13 AC 7 ms
4,380 KB
testcase_14 AC 6 ms
4,376 KB
testcase_15 AC 6 ms
4,384 KB
testcase_16 AC 6 ms
4,380 KB
testcase_17 AC 6 ms
4,380 KB
testcase_18 AC 5 ms
4,376 KB
testcase_19 AC 8 ms
4,380 KB
testcase_20 AC 7 ms
4,376 KB
testcase_21 AC 6 ms
4,380 KB
testcase_22 AC 6 ms
4,380 KB
testcase_23 AC 6 ms
4,384 KB
testcase_24 AC 5 ms
4,380 KB
testcase_25 AC 5 ms
4,380 KB
testcase_26 AC 6 ms
4,380 KB
testcase_27 AC 477 ms
36,700 KB
testcase_28 AC 473 ms
36,580 KB
testcase_29 AC 464 ms
36,700 KB
testcase_30 AC 470 ms
37,020 KB
testcase_31 AC 457 ms
36,440 KB
testcase_32 AC 523 ms
38,304 KB
testcase_33 AC 546 ms
37,892 KB
testcase_34 AC 502 ms
38,712 KB
testcase_35 AC 533 ms
38,584 KB
testcase_36 AC 507 ms
37,956 KB
testcase_37 AC 543 ms
38,240 KB
testcase_38 AC 499 ms
39,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

local mfl, mce = math.floor, math.ceil
local mmi, mma = math.min, math.max
local bls, brs = bit.lshift, bit.rshift
local SegTree = {}
SegTree.updateAll = function(self)
  for i = self.stagenum - 1, 1, -1 do
    local cnt = bls(1, i - 1)
    for j = 1, cnt do
      self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])
    end
  end
end
SegTree.create = function(self, n, func, emptyvalue)
  self.func, self.emptyvalue = func, emptyvalue
  local stagenum, mul = 1, 1
  self.stage = {{}}
  while mul < n do
    mul, stagenum = mul * 2, stagenum + 1
    self.stage[stagenum] = {}
  end
  self.stagenum = stagenum
  self.left_stage = {}
  for i = 1, n do
    local sp, sz = 1, bls(1, stagenum - 1)
    while(i - 1) % sz ~= 0 do
      sp, sz = sp + 1, brs(sz, 1)
    end
    self.left_stage[i] = sp
  end
  self.sz_stage = {}
  local tmp, sp = 1, stagenum
  for i = 1, n do
    if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end
    self.sz_stage[i] = sp
  end
  for i = 1, mul do self.stage[stagenum][i] = emptyvalue end
  self:updateAll()
end
SegTree.getRange = function(self, left, right)
  if left == right then return self.stage[self.stagenum][left] end
  local stagenum = self.stagenum
  local ret = self.emptyvalue
  while left <= right do
    local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])
    local sz = bls(1, stagenum - stage)
    ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])
    left = left + sz
  end
  return ret
end
SegTree.update = function(self, idx)
  for i = self.stagenum - 1, 1, -1 do
    local dst = brs(idx + 1, 1)
    local rem = dst * 4 - 1 - idx
    self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])
    idx = dst
  end
end
SegTree.setValue = function(self, idx, value, silent)
  self.stage[self.stagenum][idx] = value
  if not silent then
    self:update(idx)
  end
end
SegTree.right_bound = function(self, val, left, right)
  local ret, retpos = self.emptyvalue, left - 1
  ret = 0 --!
  local l, r = left, right
  local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])
  local stagenum = self.stagenum
  while true do
    local sz = bls(1, stagenum - stage)
    local tmp = self.func(ret, self.stage[stage][mce(l / sz)])
    if tmp < val then
      ret, retpos = tmp, l + sz - 1
      if retpos == right then break end
      if l + sz <= r then
        l = l + sz
        stage = mma(self.left_stage[l], self.sz_stage[r - l + 1])
      else break end
    else
      if sz ~= 1 then stage, r = stage + 1, l + sz - 2
      else break end
    end
  end
  return retpos + 1
end
SegTree.new = function(n, func, emptyvalue)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(n, func, emptyvalue)
  return obj
end
local function comp(a, b)
  return a < b
end

local function lower_bound(ary, x)
  local num = #ary
  if num == 0 then return 1 end
  if not comp(ary[1], x) then return 1 end
  if comp(ary[num], x) then return num + 1 end
  local min, max = 1, num
  while 1 < max - min do
    local mid = mfl((min + max) / 2)
    if comp(ary[mid], x) then
      min = mid
    else
      max = mid
    end
  end
  return max
end

local n, a, b = io.read("*n", "*n", "*n")
local st = SegTree.new(n, bit.bor, 1)
local x = {}
local parent = {}
local pend = {}
local edge = {}
for i = 1, n do
  x[i] = io.read("*n")
  parent[i] = i
  pend[i] = 0
  edge[i] = {}
end
assert(x[n] <= 1000000007-7)
local left, right = 1, 0
for i = 1, n do
  left = lower_bound(x, x[i] + a)
  right = lower_bound(x, x[i] + b + 1) - 1
  -- print(i, left, right)
  if left <= right then
    table.insert(edge[i], left)
    table.insert(edge[left], i)
    local lb = st:right_bound(1, left, n)
    for j = lb, right - 1 do
      table.insert(edge[j], j + 1)
      table.insert(edge[j + 1], j)
      st:setValue(j, 0)
    end
  end
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

for i = 1, n do
  local ri = uf_findroot(i)
  for j = 1, #edge[i] do
    local z = edge[i][j]
    local rz = uf_findroot(z)
    parent[z], parent[rz] = ri, ri
  end
end

local g = {}
for i = 1, n do
  local p = uf_findroot(i)
  if g[p] then g[p] = g[p] + 1 else g[p] = 1 end
end
for i = 1, n do
  print(g[uf_findroot(i)])
end
0