結果
| 問題 | 
                            No.2443 特殊線形群の標準表現
                             | 
                    
| コンテスト | |
| ユーザー | 
                             mkawa2
                         | 
                    
| 提出日時 | 2023-08-25 22:21:10 | 
| 言語 | PyPy3  (7.3.15)  | 
                    
| 結果 | 
                             
                                WA
                                 
                             
                            
                         | 
                    
| 実行時間 | - | 
| コード長 | 1,556 bytes | 
| コンパイル時間 | 297 ms | 
| コンパイル使用メモリ | 82,292 KB | 
| 実行使用メモリ | 161,724 KB | 
| 最終ジャッジ日時 | 2024-12-24 09:33:04 | 
| 合計ジャッジ時間 | 7,438 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge3 / judge4 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| other | AC * 7 WA * 14 | 
ソースコード
import sys
sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 63)
# md = 10**9+7
# md = 998244353
def dot(aa, bb):
    h = len(aa)
    w = len(bb[0])
    res = [[0]*w for _ in range(h)]
    for i, row in enumerate(aa):
        for j, col in enumerate(zip(*bb)):
            v = 0
            # for a, b in zip(row, col): v += a*b
            for a, b in zip(row, col): v = (v+a*b)%md
            res[i][j] = v
    return res
def matinv(mat):
    [[a, b], [c, d]] = mat
    return [[d, -b], [-c, a]]
n, md, q = LI()
aa = []
for _ in range(n): aa.append(LLI(2))
cs = [None]*(n+1)
cs[0] = [[1, 0], [0, 1]]
for i in range(n):
    cs[i+1] = dot(aa[i], cs[i])
ics = [None]*(n+1)
ics[0] = [[1, 0], [0, 1]]
for i in range(n):
    ics[i+1] = dot(ics[i], matinv(aa[i]))
# p2D(cs)
# p2D(ics)
for _ in range(q):
    l, r, x, y = LI()
    ans = dot(dot(cs[r], cs[l]), [[x], [y]])
    [[a], [b]] = ans
    print(a, b)
            
            
            
        
            
mkawa2