結果
問題 | No.1141 田グリッド |
ユーザー | dot_haraai |
提出日時 | 2021-06-02 19:13:52 |
言語 | Nim (2.0.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,788 bytes |
コンパイル時間 | 6,419 ms |
コンパイル使用メモリ | 88,864 KB |
実行使用メモリ | 8,576 KB |
最終ジャッジ日時 | 2024-11-15 14:24:59 |
合計ジャッジ時間 | 11,938 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 6 ms
5,248 KB |
testcase_09 | AC | 4 ms
5,248 KB |
testcase_10 | AC | 6 ms
5,248 KB |
testcase_11 | AC | 8 ms
5,248 KB |
testcase_12 | AC | 5 ms
5,248 KB |
testcase_13 | AC | 244 ms
6,912 KB |
testcase_14 | AC | 268 ms
8,576 KB |
testcase_15 | AC | 276 ms
5,504 KB |
testcase_16 | AC | 273 ms
5,632 KB |
testcase_17 | AC | 276 ms
6,016 KB |
testcase_18 | AC | 139 ms
5,504 KB |
testcase_19 | AC | 141 ms
5,632 KB |
testcase_20 | AC | 139 ms
5,632 KB |
testcase_21 | AC | 275 ms
6,400 KB |
testcase_22 | AC | 281 ms
6,528 KB |
testcase_23 | AC | 273 ms
6,272 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
コンパイルメッセージ
/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]
ソースコード
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 = 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: board[y][x] = ((((a[y-1][x-1]*board[y-1][x]).mod(md)*(board[y][x-1]*modinv(board[y-1][x-1],md)).mod(md)).mod(md))+md).mod(md) #echo board.join("\n") for (y,x) in yx: var lower_right = (((board[h][w]*modinv(board[h][x],md)).mod(md)*(modinv(board[y][w],md)*board[y][x]).mod(md)).mod(md)+md).mod(md) lower_left = ((board[h][x-1]*modinv(board[y][x-1],md)).mod(md)+md).mod(md) upper_right = ((board[y-1][w]*modinv(board[y-1][x],md)).mod(md)+md).mod(md) upper_left = board[y-1][x-1] echo (((lower_right*lower_left).mod(md)*((upper_right*upper_left).mod(md))).mod(md)+md).mod(md) solve()