結果
問題 | No.1141 田グリッド |
ユーザー | 👑 obakyan |
提出日時 | 2020-08-13 22:17:42 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 119 ms / 2,000 ms |
コード長 | 2,549 bytes |
コンパイル時間 | 47 ms |
コンパイル使用メモリ | 6,812 KB |
実行使用メモリ | 25,984 KB |
最終ジャッジ日時 | 2024-04-18 01:53:13 |
合計ジャッジ時間 | 3,010 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 7 ms
6,940 KB |
testcase_09 | AC | 5 ms
6,944 KB |
testcase_10 | AC | 6 ms
6,944 KB |
testcase_11 | AC | 7 ms
6,944 KB |
testcase_12 | AC | 7 ms
6,944 KB |
testcase_13 | AC | 67 ms
7,936 KB |
testcase_14 | AC | 119 ms
25,984 KB |
testcase_15 | AC | 82 ms
8,832 KB |
testcase_16 | AC | 82 ms
9,344 KB |
testcase_17 | AC | 75 ms
7,808 KB |
testcase_18 | AC | 68 ms
7,296 KB |
testcase_19 | AC | 70 ms
9,344 KB |
testcase_20 | AC | 72 ms
9,344 KB |
testcase_21 | AC | 75 ms
8,832 KB |
testcase_22 | AC | 71 ms
8,832 KB |
testcase_23 | AC | 72 ms
8,832 KB |
testcase_24 | AC | 67 ms
7,040 KB |
testcase_25 | AC | 66 ms
8,704 KB |
testcase_26 | AC | 75 ms
7,424 KB |
testcase_27 | AC | 70 ms
7,808 KB |
testcase_28 | AC | 68 ms
8,576 KB |
testcase_29 | AC | 67 ms
7,680 KB |
testcase_30 | AC | 69 ms
7,552 KB |
testcase_31 | AC | 69 ms
10,112 KB |
testcase_32 | AC | 70 ms
8,832 KB |
testcase_33 | AC | 69 ms
8,704 KB |
ソースコード
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 local function modpow(src, pow) local res = 1 while 0 < pow do if pow % 2 == 1 then res = bmul(res, src) pow = pow - 1 end src = bmul(src, src) pow = mfl(pow / 2) end return res end local function modinv(src) return modpow(src, mod - 2) end local h, w = io.read("*n", "*n") local t = {} for i = 1, h do for j = 1, w do t[(i - 1) * w + j] = io.read("*n") end end local topleft = {} do topleft[1] = {} local z = 1 for j = 1, w do z = bmul(z, t[j]) topleft[1][j] = z end end for i = 2, h do topleft[i] = {} local z = 1 for j = 1, w do local idx = (i - 1) * w + j z = bmul(z, t[idx]) topleft[i][j] = bmul(topleft[i - 1][j], z) end end local topright = {} do topright[1] = {} local z = 1 for j = w, 1, -1 do z = bmul(z, t[j]) topright[1][w + 1 - j] = z end end for i = 2, h do topright[i] = {} local z = 1 for j = w, 1, -1 do local idx = (i - 1) * w + j z = bmul(z, t[idx]) topright[i][w + 1 - j] = bmul(topright[i - 1][w + 1 - j], z) end end local bottomleft = {} for i = 1, h do bottomleft[i] = {} end do local z = 1 for j = 1, w do z = bmul(z, t[(h - 1) * w + j]) bottomleft[h][j] = z end end for i = h - 1, 1, -1 do local z = 1 for j = 1, w do local idx = (i - 1) * w + j z = bmul(z, t[idx]) bottomleft[i][j] = bmul(bottomleft[i + 1][j], z) end end local bottomright = {} for i = 1, h do bottomright[i] = {} end do local z = 1 for j = w, 1, -1 do z = bmul(z, t[(h - 1) * w + j]) bottomright[h][w + 1 - j] = z end end for i = h - 1, 1, -1 do local z = 1 for j = w, 1, -1 do local idx = (i - 1) * w + j z = bmul(z, t[idx]) bottomright[i][w + 1 - j] = bmul(bottomright[i + 1][w + 1 - j], z) end end local q = io.read("*n") for iq = 1, q do local r, c = io.read("*n", "*n") local z = 1 if 1 < r and 1 < c then z = bmul(z, topleft[r - 1][c - 1]) end if r < h and 1 < c then z = bmul(z, bottomleft[r + 1][c - 1]) end if 1 < r and c < w then z = bmul(z, topright[r - 1][w - c]) end if r < h and c < w then z = bmul(z, bottomright[r + 1][w - c]) end print(z) end