結果

問題 No.1141 田グリッド
ユーザー hedwig100
提出日時 2020-07-31 22:52:19
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 166 ms / 2,000 ms
コード長 3,004 bytes
コンパイル時間 1,589 ms
コンパイル使用メモリ 175,872 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-06 20:19:09
合計ジャッジ時間 6,074 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;
template<int Modulus>
struct ModInt {
long long x;
ModInt(long long x = 0) :x((x%Modulus + Modulus)%Modulus) {}
constexpr ModInt &operator+=(const ModInt a) {if ((x += a.x) >= Modulus) x -= Modulus; return *this;}
constexpr ModInt &operator-=(const ModInt a) {if ((x += Modulus - a.x) >= Modulus) x -= Modulus; return *this;}
constexpr ModInt &operator*=(const ModInt a) {(x *= a.x) %= Modulus; return *this;}
constexpr ModInt &operator/=(const ModInt a) {return *this *= a.inverse();}
constexpr ModInt operator+(const ModInt a) const {return ModInt(*this) += a.x;}
constexpr ModInt operator-(const ModInt a) const {return ModInt(*this) -= a.x;}
constexpr ModInt operator*(const ModInt a) const {return ModInt(*this) *= a.x;}
constexpr ModInt operator/(const ModInt a) const {return ModInt(*this) /= a.x;}
friend constexpr ostream& operator<<(ostream& os,const ModInt<Modulus>& a) {return os << a.x;}
friend constexpr istream& operator>>(istream& is,ModInt<Modulus>& a) {return is >> a.x;}
ModInt inverse() const {// x ^ (-1)
long long a = x,b = Modulus,p = 1,q = 0;
while (b) {long long d = a/b; a -= d*b; swap(a,b); p -= d*q; swap(p,q);}
return ModInt(p);
}
ModInt pow(long long N) {// x ^ N
ModInt a = 1;
while (N) {
if (N&1) a *= *this;
*this *= *this;
N >>= 1;
}
return a;
}
};
using mint = ModInt<1000000007>;
int main() {
int H,W; cin >> H >> W;
vector<vector<ll>> A(H,vector<ll>(W));
rep(i,H)rep(j,W) cin >> A[i][j];
vector<mint> R(H),C(W);
vector<int> Rzero(H,0),Czero(W,0);
rep(i,H) {
mint cumprd = 1;
rep(j,W) {
if (A[i][j] > 0) cumprd *= A[i][j];
if (A[i][j] == 0) Rzero[i]++;
}
R[i] = cumprd;
}
rep(i,W) {
mint cumprd = 1;
rep(j,H) {
if (A[j][i] > 0) cumprd *= A[j][i];
if (A[j][i] == 0) Czero[i]++;
}
C[i] = cumprd;
}
mint cumprd = 1;
rep(i,H) cumprd *= R[i];
int tot_z = 0;
rep(i,H) tot_z += Rzero[i];
int Q; cin >> Q;
rep(i,Q) {
int r,c; cin >> r >> c;
--r; --c;
int z = tot_z;
z -= Rzero[r]; z -= Czero[c];
if (A[r][c] == 0) z += 1;
if (z > 0) {
cout << 0 << '\n';
continue;
}
mint ans = cumprd;
ans /= R[r];
ans /= C[c];
if (A[r][c] > 0) ans *= A[r][c];
cout << ans << '\n';
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0