結果

問題 No.1141 田グリッド
ユーザー dot_haraaidot_haraai
提出日時 2021-06-02 19:55:10
言語 Nim
(2.0.2)
結果
AC  
実行時間 346 ms / 2,000 ms
コード長 2,369 bytes
コンパイル時間 4,903 ms
コンパイル使用メモリ 88,692 KB
実行使用メモリ 15,616 KB
最終ジャッジ日時 2024-04-27 13:16:44
合計ジャッジ時間 12,583 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 12 ms
6,944 KB
testcase_09 AC 8 ms
6,944 KB
testcase_10 AC 13 ms
6,944 KB
testcase_11 AC 21 ms
6,940 KB
testcase_12 AC 12 ms
6,940 KB
testcase_13 AC 264 ms
10,496 KB
testcase_14 AC 298 ms
15,616 KB
testcase_15 AC 340 ms
7,936 KB
testcase_16 AC 340 ms
8,320 KB
testcase_17 AC 342 ms
8,704 KB
testcase_18 AC 175 ms
8,192 KB
testcase_19 AC 175 ms
8,320 KB
testcase_20 AC 173 ms
8,320 KB
testcase_21 AC 346 ms
10,112 KB
testcase_22 AC 344 ms
10,240 KB
testcase_23 AC 344 ms
10,112 KB
testcase_24 AC 295 ms
11,904 KB
testcase_25 AC 289 ms
8,064 KB
testcase_26 AC 294 ms
8,192 KB
testcase_27 AC 292 ms
8,576 KB
testcase_28 AC 290 ms
7,936 KB
testcase_29 AC 249 ms
8,704 KB
testcase_30 AC 246 ms
8,320 KB
testcase_31 AC 207 ms
11,392 KB
testcase_32 AC 283 ms
10,112 KB
testcase_33 AC 281 ms
10,112 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')


# 拡張ユークリッド互除法

proc xgcd(a,b:int):(int,int,int)=
  var
    b = b
    x0=1
    y0=0
    x1=0
    y1=1
    q:int
    a = a
  while b!=0:
    (q,a,b) = (a.div(b),b,a.mod(b))
    (x0,x1)=(x1,x0-q*x1)
    (y0,y1)=(y1,y0-q*y1)
  return (a,x0,y0)

# modの逆元
proc modinv(a,m:int):int=
  var (g,x,y)=xgcd(a,m)
  if g!=1:
    return -1
  else:
    return x mod m




proc solve()=
  var
    h = scan()
    w = scan()
    a = newseqwith(h,newseqwith(w,scan()))
    board_UL = newseqwith(h+1,newseqwith(w+1,1))
    board_UR = newseqwith(h+1,newseqwith(w+1,1))
    board_LL = newseqwith(h+1,newseqwith(w+1,1))
    board_LR = newseqwith(h+1,newseqwith(w+1,1))
    q = scan()
    yx = newseqwith(q,(scan(),scan()))
    md = 10^9+7
  
  for y in 1..h:
    for x in 1..w:
      boardUL[y][x] = ((((a[y-1][x-1]*boardUL[y-1][x]).mod(md)*(boardUL[y][x-1]*modinv(boardUL[y-1][x-1],md)).mod(md)).mod(md))+md).mod(md)
  for y in 1..h:
    for x in countdown(w-1,0):
      boardUR[y][x] = ((((a[y-1][x]*boardUR[y-1][x]).mod(md)*(boardUR[y][x+1]*modinv(boardUR[y-1][x+1],md)).mod(md)).mod(md))+md).mod(md)
  for y in countdown(h-1,0):
    for x in 1..w:
      boardLL[y][x] = ((((a[y][x-1]*boardLL[y+1][x]).mod(md)*(boardLL[y][x-1]*modinv(boardLL[y+1][x-1],md)).mod(md)).mod(md))+md).mod(md)
  for y in countdown(h-1,0):
    for x in countdown(w-1,0):
      boardLR[y][x] = ((((a[y][x]*boardLR[y+1][x]).mod(md)*(boardLR[y][x+1]*modinv(boardLR[y+1][x+1],md)).mod(md)).mod(md))+md).mod(md)

  
  #echo boardUL.join("\n")
  #echo ""
  #echo boardUR.join("\n")
  #echo ""
  #echo boardLL.join("\n")
  #echo ""
  #echo boardLR.join("\n")
  for (y, x) in yx:
    var t = 1
    t*=board_UL[y-1][x-1]
    t.mod=md
    t*=board_UR[y-1][x]
    t.mod=md
    t*=board_LL[y][x-1]
    t.mod=md
    t*=board_LR[y][x]
    t.mod=md
    echo t

  
solve()
0