結果

問題 No.1141 田グリッド
ユーザー semisagi
提出日時 2020-07-31 21:38:50
言語 Swift
(6.0.3)
結果
WA  
実行時間 -
コード長 2,922 bytes
コンパイル時間 2,014 ms
コンパイル使用メモリ 131,416 KB
実行使用メモリ 17,076 KB
最終ジャッジ日時 2024-07-06 17:02:47
合計ジャッジ時間 6,301 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 10 WA * 1 TLE * 1 -- * 19
権限があれば一括ダウンロードができます

ソースコード

diff # 

fileprivate struct Scanner {
    private var elements = [String]()
    private var index = 0
    
    mutating func peek() -> String {
        while elements.count == index {
            elements = readLine()!.split(separator: " ").map(String.init)
            index = 0
        }
        return elements[index]
    }
    
    mutating func next() -> String {
        let value = peek()
        index += 1
        return value
    }
    
    mutating func nextInt() -> Int {
        return Int(next())!
    }
    
    mutating func nextDouble() -> Double {
        return Double(next())!
    }
}

fileprivate let MOD = 1000000007

fileprivate struct Zn {
    let n: Int
    
    init(_ n: Int) {
        self.n = n
    }
    
    static func + (lhs: Self, rhs: Self) -> Self {
        let n = lhs.n + rhs.n
        return Zn(n < MOD ? n : n - MOD)
    }
    
    static func - (lhs: Self, rhs: Self) -> Self {
        let n = lhs.n - rhs.n
        return Zn(n >= 0 ? n : n + MOD)
    }
    
    static func * (lhs: Self, rhs: Self) -> Self {
        Zn((lhs.n * rhs.n) % MOD)
    }
    
    static func += (lhs: inout Self, rhs: Self) {
        lhs = lhs + rhs
    }
    
    static func -= (lhs: inout Self, rhs: Self) {
        lhs = lhs - rhs
    }
    
    static func *= (lhs: inout Self, rhs: Self) {
        lhs = lhs * rhs
    }
    
    func pow(_ n: Int) -> Self {
        if n == 0 {
            return Zn(1)
        } else if n % 2 == 1 {
            return self * self.pow(n - 1)
        } else {
            return (self * self).pow(n / 2)
        }
    }
    
    var inverse: Self {
        self.pow(MOD - 2)
    }
}

fileprivate struct Array2D<Element> {
    let n1: Int
    let n2: Int
    private var elements: [Element]
    
    init(repeating: Element, _ n1: Int, _ n2: Int) {
        self.n1 = n1
        self.n2 = n2
        self.elements = [Element](repeating: repeating, count: n1 * n2)
    }
    
    subscript(i: Int, j: Int) -> Element {
        get {
            elements[i * n2 + j]
        }
        set {
            elements[i * n2 + j] = newValue
        }
    }
}


func main() {
    var scanner = Scanner()
    
    let H = scanner.nextInt()
    let W = scanner.nextInt()
    
    var A = Array2D(repeating: 0, H, W)
    for i in 0 ..< H {
        for j in 0 ..< W {
            A[i, j] = scanner.nextInt()
        }
    }
    
    let row = (0 ..< H).map { i in
        (0 ..< W).map { j in Zn(A[i, j]) }.reduce(Zn(1), *)
    }
    let col = (0 ..< H).map { j in
        (0 ..< H).map { i in Zn(A[i, j]) }.reduce(Zn(1), *)
    }
    let total = (0 ..< H).flatMap { i in
        (0 ..< W).map { j in Zn(A[i, j]) }
    }.reduce(Zn(1), *)
    
    let Q = scanner.nextInt()
    for _ in 0 ..< Q {
        let y = scanner.nextInt() - 1
        let x = scanner.nextInt() - 1
        let answer = total * row[y].inverse * col[x].inverse * Zn(A[y, x])
        print(answer.n)
    }
}

main()
0