結果

問題 No.1141 田グリッド
ユーザー omochana2
提出日時 2019-10-16 02:00:29
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 52 ms / 2,000 ms
コード長 4,548 bytes
コンパイル時間 1,664 ms
コンパイル使用メモリ 171,948 KB
実行使用メモリ 9,088 KB
最終ジャッジ日時 2024-07-06 12:52:20
合計ジャッジ時間 5,410 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
    cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
    out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
    out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////
ll mod_pow(ll a, ll n) {
    if(n == 0) return 1;
    ll res = mod_pow(a, n / 2);
    if(n % 2 == 0) return res * res % mod;
    else return a * res % mod * res % mod;
}
ll invf(ll a) {
    return mod_pow(a, mod - 2);
}
int N, M;
void solve() {
    cin >> N >> M;
    vector<vl> A(N, vl(M, 0));
    vector<vl> ans(N, vl(M, 0));
    rep(i, 0, N) {
        rep(j, 0, M) {
            cin >> A[i][j];
        }
    }
    auto find_zero = [&](int x1, int y1, int x2, int y2) -> pi {
        rep(i, x1, x2) {
            rep(j, y1, y2) {
                if(A[i][j] == 0) {
                    return pi(i, j);
                }
            }
        }
        return pi(-1, -1);
    };
    pi p = find_zero(0, 0, N, M);
    if(p == pi(-1, -1)) {
        ll mul = 1;
        rep(i, 0, N) {
            rep(j, 0, M) {
                mul *= A[i][j];
                mul %= mod;
            }
        }
        vector<ll> H(M, 1), V(N, 1);
        rep(i, 0, N) {
            rep(j, 0, M) {
                V[i] *= A[i][j];
                V[i] %= mod;
            }
            V[i] = invf(V[i]);
        }
        rep(j, 0, M) {
            rep(i, 0, N) {
                H[j] *= A[i][j];
                H[j] %= mod;
            }
            H[j] = invf(H[j]);
        }
        rep(i, 0, N) {
            rep(j, 0, M) {
                ans[i][j] = mul * V[i] % mod * H[j] % mod * A[i][j] % mod;
            }
        }
        // debug(ans);
    }
    else {
        int x = p.fst, y = p.sec;
        int v = -1, w = -1;
        //horizontal
        rep(j, 0, M) {
            rep(i, 0, N) {
                if(i == x) continue;
                if(A[i][j] == 0) {
                    v = j;
                    break;
                }
            }
        }
        if(v == -1) {
            ll mul = 1;
            rep(i, 0, N) {
                rep(j, 0, M) {
                    if(i == x) continue;
                    mul *= A[i][j];
                    mul %= mod;
                }
            }
            rep(j, 0, M) {
                ll iv = 1;
                rep(i, 0, N) {
                    if(i == x) continue;
                    iv *= A[i][j];
                    iv %= mod;
                }
                ans[x][j] = mul * invf(iv) % mod;
            }
        }
        else {
            ans[x][v] = 1;
            rep(i, 0, N) {
                rep(j, 0, M) {
                    if(i == x || j == v) continue;
                    ans[x][v] *= A[i][j];
                    ans[x][v] %= mod;
                }
            }
        }
        rep(i, 0, N) {
            rep(j, 0, M) {
                if(j == y) continue;
                if(A[i][j] == 0) {
                    w = i;
                    break;
                }
            }
        }
        if(w == -1) {
            ll mul = 1;
            rep(i, 0, N) {
                rep(j, 0, M) {
                    if(j == y) continue;
                    mul *= A[i][j];
                    mul %= mod;
                }
            }
            rep(i, 0, N) {
                ll iv = 1;
                rep(j, 0, M) {
                    if(j == y) continue;
                    iv *= A[i][j];
                    iv %= mod;
                }
                ans[i][y] = mul * invf(iv) % mod;
            }
        }
        else {
            ans[w][y] = 1;
            rep(i, 0, N) {
                rep(j, 0, M) {
                    if(i == w || j == y) continue;
                    ans[w][y] *= A[i][j];
                    ans[w][y] %= mod;
                }
            }
        }
        // debug(x, v, y, w, p);
    }
    int Q; cin >> Q;
    while(Q--) {
        int a, b; cin >> a >> b; a--; b--;
        cout << ans[a][b] << "\n";
    }
}
uint32_t rd() {
    uint32_t res;
#ifdef __MINGW32__
    asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
    res = std::random_device()();
#endif
    return res;
}
int main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
    cout.precision(20);
    cerr << fixed;
    cerr.precision(6);
    rng.seed(rd());
#ifdef LOCAL
    //freopen("in.txt", "wt", stdout); //for tester
    if(!freopen("in.txt", "rt", stdin)) return 1;
#endif  
    solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0