結果

問題 No.1141 田グリッド
ユーザー 👑 hos.lyric
提出日時 2020-07-31 21:48:36
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 114 ms / 2,000 ms
コード長 4,764 bytes
コンパイル時間 1,876 ms
コンパイル使用メモリ 154,484 KB
実行使用メモリ 15,304 KB
最終ジャッジ日時 2024-06-22 07:56:09
合計ジャッジ時間 4,426 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std
    .typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; 
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
struct ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}
enum MO = 1000000007;
alias Mint = ModInt!MO;
void main() {
  try {
    for (; ; ) {
      const H = readInt();
      const W = readInt();
      auto A = new int[][](H, W);
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        A[x][y] = readInt();
      }
      const Q = readInt();
      auto R = new int[Q];
      auto C = new int[Q];
      foreach (q; 0 .. Q) {
        R[q] = readInt() - 1;
        C[q] = readInt() - 1;
      }
      
      auto f00 = new Mint[][](H + 1, W + 1);
      auto f01 = new Mint[][](H + 1, W + 1);
      auto f10 = new Mint[][](H + 1, W + 1);
      auto f11 = new Mint[][](H + 1, W + 1);
      foreach (x; 0 .. H + 1) foreach (y; 0 .. W + 1) {
        f00[x][y] = 1;
        f01[x][y] = 1;
        f10[x][y] = 1;
        f11[x][y] = 1;
      }
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        f00[x + 1][y + 1] = A[x][y];
        f01[x + 1][y] = A[x][y];
        f10[x][y + 1] = A[x][y];
        f11[x][y] = A[x][y];
      }
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        f00[x + 1][y] *= f00[x][y];
        f01[x + 1][y] *= f01[x][y];
      }
      foreach_reverse (x; 0 .. H) foreach (y; 0 .. W) {
        f10[x][y] *= f10[x + 1][y];
        f11[x][y] *= f11[x + 1][y];
      }
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        f00[x][y + 1] *= f00[x][y];
        f10[x][y + 1] *= f10[x][y];
      }
      foreach (x; 0 .. H) foreach_reverse (y; 0 .. W) {
        f01[x][y] *= f01[x][y + 1];
        f11[x][y] *= f11[x][y + 1];
      }
      debug {
        writeln("f00 = ", f00);
        writeln("f01 = ", f01);
        writeln("f10 = ", f10);
        writeln("f11 = ", f11);
      }
      
      foreach (q; 0 .. Q) {
        Mint ans = 1;
        ans *= f00[R[q]][C[q]];
        ans *= f01[R[q]][C[q] + 1];
        ans *= f10[R[q] + 1][C[q]];
        ans *= f11[R[q] + 1][C[q] + 1];
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0