結果
| 問題 |
No.1569 Nixoracci's Number
|
| コンテスト | |
| ユーザー |
👑 |
| 提出日時 | 2021-08-10 20:01:32 |
| 言語 | Lua (LuaJit 2.1.1734355927) |
| 結果 |
AC
|
| 実行時間 | 1,246 ms / 2,000 ms |
| コード長 | 1,793 bytes |
| コンパイル時間 | 211 ms |
| コンパイル使用メモリ | 6,816 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-09-22 22:12:16 |
| 合計ジャッジ時間 | 9,009 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 21 |
ソースコード
local mfl, mce = math.floor, math.ceil
local ffi = require("ffi")
local C = ffi.C
ffi.cdef[[
long long atoll(const char*);
]]
local function lltonumber(str)
return C.atoll(str)
end
local n, k = io.read():match("(%d+) (%d+)")
n = tonumber(n)
local strk = k
k = lltonumber(k)
local str = io.read()
local dlim = 60
local mat = {}
for i = 1, n - 1 do
mat[i] = {}
for j = 1, n do
mat[i][j] = 1 + i == j and 1 or 0
end
end
mat[n] = {}
for j = 1, n do mat[n][j] = 1 end
local vec = {}
for i = 1, dlim do vec[i] = {} end
local a = {}
do
local i = 0
for w in str:gmatch("%d+") do
i = i + 1
w = lltonumber(w)
a[i] = w
assert(w <= 1000000000000000000LL)
for j = 1, dlim do
vec[j][i] = w % 2LL == 0 and 0 or 1
w = w / 2LL
end
end
end
if #strk <= 3 then
local tk = tonumber(strk)
if tk <= n then
print(a[tk])
os.exit()
end
end
k = k - n
local tmpmat = {}
for i = 1, n do
tmpmat[i] = {}
end
local tmpvec = {}
local function matmat()
for i = 1, n do
for j = 1, n do
local v = 0
for k = 1, n do
v = v + mat[i][k] * mat[k][j]
end
tmpmat[i][j] = v % 2
end
end
for i = 1, n do for j = 1, n do
mat[i][j] = tmpmat[i][j]
end end
end
local function matvec()
for d = 1, dlim do
local vd = vec[d]
for i = 1, n do
local v = 0
for k = 1, n do
v = v + mat[i][k] * vec[d][k]
end
tmpvec[i] = v % 2
end
for i = 1, n do
vec[d][i] = tmpvec[i]
end
end
end
while 0LL < k do
if k % 2LL == 1LL then
matvec()
end
matmat()
k = k / 2LL
end
local ret = 0LL
local mul = 1LL
for i = 1, dlim do
if vec[i][n] == 1 then
ret = ret + mul
end
mul = mul + mul
end
ret = tostring(ret):gsub("LL", "")
print(ret)
-- print(os.clock())