#746235 (Lua) No.1876 Xor of Sum

• 問題: No.1876 Xor of Sum
• ユーザー: 👑 obakyan
• 提出日時: 2022-03-16 09:43:04
• 言語: Lua (LuaJit 2.1.1696795921)
• 結果: TLE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 1,557 bytes
• コンパイル時間: 277 ms
• コンパイル使用メモリ: 6,944 KB
• 実行使用メモリ: 7,040 KB
• 最終ジャッジ日時: 2024-09-23 06:35:26
• 合計ジャッジ時間: 35,225 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	342 ms; 6,940 KB
testcase_04	AC	989 ms; 6,940 KB
testcase_05	AC	20 ms; 6,940 KB
testcase_06	AC	1,946 ms; 6,948 KB
testcase_07	AC	25 ms; 6,940 KB
testcase_08	AC	20 ms; 6,944 KB
testcase_09	AC	849 ms; 6,940 KB
testcase_10	AC	264 ms; 6,940 KB
testcase_11	AC	1,402 ms; 6,944 KB
testcase_12	AC	337 ms; 6,940 KB
testcase_13	AC	733 ms; 6,940 KB
testcase_14	AC	565 ms; 6,940 KB
testcase_15	AC	704 ms; 6,940 KB
testcase_16	AC	14 ms; 6,944 KB
testcase_17	AC	1,751 ms; 6,940 KB
testcase_18	AC	1,979 ms; 6,940 KB
testcase_19	AC	1,978 ms; 6,944 KB
testcase_20	AC	1,974 ms; 6,944 KB
testcase_21	AC	1,964 ms; 6,940 KB
testcase_22	AC	1,973 ms; 6,940 KB
testcase_23	TLE	-
testcase_24	TLE	-
testcase_25	TLE	-
testcase_26	TLE	-
testcase_27	TLE	-
testcase_28	AC	1,971 ms; 6,944 KB
testcase_29	AC	1,890 ms; 7,040 KB

ソースコード

local mfl, mce = math.floor, math.ceil
local bls, brs = bit.lshift, bit.rshift
local bor, band = bit.bor, bit.band
local bxor = bit.bxor
local TFDP = {}

TFDP.initialize = function(self, lim)
  self.lim = lim
  self.sz = 30
  self.way = true
  self.bcnt = mce((lim + 1) / self.sz)
  self.b1, self.b2 = {1}, {}
  for i = 2, self.bcnt do
    self.b1[i] = 0
    self.b2[i] = 0
  end
  self.curmax = 0
end

TFDP.add = function(self, v, cursum)
  local src = self.way and self.b1 or self.b2
  local dst = self.way and self.b2 or self.b1
  self.way = not self.way
  local bcnt = self.bcnt
  local bc2 = mce((cursum + 1) / self.sz)
  for i = 1, bc2 do
    dst[i] = src[i]
  end
  local sz = self.sz
  local jump, rem = mfl(v / sz), v % sz
  local denom, mul = bls(1, sz - rem), bls(1, rem)
  for i = 1, bcnt - jump do
    local v1 = src[i] % denom
    dst[i + jump] = bxor(dst[i + jump], v1 * mul)
  end
  for i = 1, bcnt - jump - 1 do
    local v2 = brs(src[i], sz - rem)
    dst[i + jump + 1] = bxor(dst[i + jump + 1], v2)
  end
end

TFDP.query = function(self, x)
  local group = mfl(x / self.sz) + 1
  local idx = x - (group - 1) * self.sz
  local tbl = self.way and self.b1 or self.b2
  return band(tbl[group], bls(1, idx)) ~= 0
end

local tf = TFDP
local n = io.read("*n")
local lim = n * 2000
tf:initialize(lim)
local cursum = 0
for i = 1, n do
  local a = io.read("*n")
  tf:add(a, cursum)
  cursum = cursum + a
end
-- print(os.clock())
local ret = 0
for i = 1, lim do
  if tf:query(i) then
    ret = bxor(ret, i)
  end
end
print(ret)
-- print(os.clock())