結果
問題 | No.1141 田グリッド |
ユーザー |
|
提出日時 | 2020-07-31 21:49:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 158 ms / 2,000 ms |
コード長 | 3,995 bytes |
コンパイル時間 | 1,972 ms |
コンパイル使用メモリ | 195,396 KB |
最終ジャッジ日時 | 2025-01-12 09:48:26 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define elif else if#define sp(x) fixed << setprecision(x)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define sz(x) (int)x.size()using ll = long long;using ld = long double;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;const ll MOD = 1e9+7;//const ll MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;const ld EPS = 1e-10;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};template<ll mod>struct Mod_Int{ll x;Mod_Int() {}Mod_Int(ll y) : x (y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}Mod_Int &operator += (const Mod_Int &p){x = (x + p.x) % mod;return *this;}Mod_Int &operator -= (const Mod_Int &p){x = (x + mod - p.x) % mod;return *this;}Mod_Int &operator *= (const Mod_Int &p){x = (x * p.x) % mod;return *this;}Mod_Int &operator /= (const Mod_Int &p){*this *= p.inverse();return *this;}Mod_Int &operator ++ () {return *this += Mod_Int(1);}Mod_Int operator ++ (int){Mod_Int tmp = *this;++*this;return tmp;}Mod_Int &operator -- () {return *this -= Mod_Int(1);}Mod_Int operator -- (int){Mod_Int tmp = *this;--*this;return tmp;}Mod_Int operator - () const {return Mod_Int(-x);}Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}bool operator == (const Mod_Int &p) const {return x == p.x;}bool operator != (const Mod_Int &p) const {return x != p.x;}Mod_Int pow(ll n) const{Mod_Int now = *this, ret = 1;while(n > 0){if(n & 1) ret *= now;now *= now, n >>= 1;}return ret;}Mod_Int inverse() const{return pow(mod-2);}friend ostream &operator << (ostream &os, const Mod_Int &p){return os << p.x;}friend istream &operator >> (istream &is, Mod_Int &p){ll a;is >> a;p = Mod_Int<mod>(a);return is;}};using mint = Mod_Int<MOD>;const int MAX_N = 1e6;mint fac[MAX_N+1], ifac[MAX_N+1];void init(){fac[0] = 1;rep2(i, 1, MAX_N){fac[i] = fac[i-1]*i;}ifac[MAX_N] = fac[MAX_N].inverse();rep3(i, MAX_N, 1){ifac[i-1] = ifac[i]*i;}}mint comb(int n, int k){return fac[n]*ifac[n-k]*ifac[k];}mint perm(int n, int k){return fac[n]*ifac[n-k];}int main(){int H, W;cin >> H >> W;mint A[H][W], B[H], C[W];int P[H], Q[W];mint all = 1;int cnt = 0;rep(i, H){rep(j, W){cin >> A[i][j];if(A[i][j] != 0) all *= A[i][j];else cnt++;}}rep(i, H){B[i] = 1, P[i] = 0;rep(j, W){if(A[i][j] != 0) B[i] *= A[i][j];else P[i]++;}}rep(j, W){C[j] = 1, Q[j] = 0;rep(i, H){if(A[i][j] != 0) C[j] *= A[i][j];else Q[j]++;}}int q;cin >> q;rep(i, q){int x, y; cin >> x >> y; x--, y--;int num = P[x]+Q[y]-(A[x][y] == 0);if(num < cnt) cout << 0 << endl;else{mint ans = all/(B[x]*C[y]);if(A[x][y] != 0) ans *= A[x][y];cout << ans << endl;}}}