結果

問題 No.1704 Many Bus Stops (easy)
ユーザー 👑 obakyan
提出日時 2022-08-12 13:50:42
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 139 ms / 2,000 ms
コード長 1,689 bytes
コンパイル時間 185 ms
コンパイル使用メモリ 6,944 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-22 16:31:25
合計ジャッジ時間 5,283 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

local mod = 1000000007
local mfl = math.floor
local function bmul(x, y)
local x1, y1 = mfl(x / 31623), mfl(y / 31623)
local x0, y0 = x - x1 * 31623, y - y1 * 31623
return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod
end
local function badd(x, y)
return (x + y) % mod
end
local function bsub(x, y)
return x < y and x - y + mod or x - y
end
--[[
a[i]: at A
b[i]: at B or C
c[i]: moving to A
d[i]: moving to B or C
a[i + 1] = 1/3 * a[i] + c[i]
b[i + 1] = 1/3 * b[i] + d[i]
c[i + 1] = 1/3 * b[i]
d[i + 1] = 2/3 * a[i] + 1/3 * b[i]
]]
local mat = {}
local tmpmat = {}
for i = 1, 4 do
mat[i] = {}
tmpmat[i] = {}
end
local vec = {}
local tmpvec = {}
local function matmat()
for i = 1, 4 do
for j = 1, 4 do
local v = 0
for k = 1, 4 do
v = badd(v, bmul(mat[i][k], mat[k][j]))
end
tmpmat[i][j] = v
end
end
for i = 1, 4 do for j = 1, 4 do
mat[i][j] = tmpmat[i][j]
end end
end
local function matvec()
for i = 1, 4 do
local v = 0
for k = 1, 4 do
v = badd(v, bmul(mat[i][k], vec[k]))
end
tmpvec[i] = v
end
for i = 1, 4 do
vec[i] = tmpvec[i]
end
end
local div3 = 333333336
local div3_2 = 666666672
local half = 500000004
local function reset()
vec[1], vec[2], vec[3], vec[4] = 1, 0, 0, 0
for i = 1, 4 do for j = 1, 4 do
mat[i][j] = 0
end end
mat[1][1], mat[1][3] = div3, 1
mat[2][2], mat[2][4] = div3, 1
mat[3][2] = div3
mat[4][1], mat[4][2] = div3_2, div3
end
local q = io.read("*n")
for iq = 1, q do
local n = io.read("*n")
reset()
while 0 < n do
if n % 2 == 1 then
matvec()
end
matmat()
n = mfl(n / 2)
end
print(vec[1])
end
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0