#521716 (C++17) No.1141 田グリッド

• 問題: No.1141 田グリッド
• ユーザー: chocopuu
• 提出日時: 2020-07-31 21:49:50
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 172 ms / 2,000 ms
• コード長: 4,845 bytes
• コンパイル時間: 2,362 ms
• コンパイル使用メモリ: 211,744 KB
• 実行使用メモリ: 7,552 KB
• 最終ジャッジ日時: 2024-07-06 17:38:44
• 合計ジャッジ時間: 6,258 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	2 ms; 6,944 KB
testcase_08	AC	5 ms; 6,944 KB
testcase_09	AC	4 ms; 6,940 KB
testcase_10	AC	5 ms; 6,940 KB
testcase_11	AC	6 ms; 6,940 KB
testcase_12	AC	4 ms; 6,944 KB
testcase_13	AC	172 ms; 6,940 KB
testcase_14	AC	153 ms; 7,552 KB
testcase_15	AC	147 ms; 6,944 KB
testcase_16	AC	146 ms; 6,944 KB
testcase_17	AC	144 ms; 6,940 KB
testcase_18	AC	118 ms; 6,944 KB
testcase_19	AC	113 ms; 6,940 KB
testcase_20	AC	115 ms; 6,944 KB
testcase_21	AC	143 ms; 6,944 KB
testcase_22	AC	144 ms; 6,940 KB
testcase_23	AC	145 ms; 6,944 KB
testcase_24	AC	112 ms; 6,940 KB
testcase_25	AC	118 ms; 6,940 KB
testcase_26	AC	113 ms; 6,940 KB
testcase_27	AC	117 ms; 6,944 KB
testcase_28	AC	115 ms; 6,940 KB
testcase_29	AC	118 ms; 6,940 KB
testcase_30	AC	114 ms; 6,940 KB
testcase_31	AC	115 ms; 6,944 KB
testcase_32	AC	116 ms; 6,940 KB
testcase_33	AC	115 ms; 6,940 KB

ソースコード

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
 

template<class T> struct BiCoef {
    vector<T> fact_, inv_, finv_;
    constexpr BiCoef() {}
    constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
        init(n);
    }
    constexpr void init(int n) noexcept {
        fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
        int MOD = fact_[0].getmod();
        for(int i = 2; i < n; i++){
            fact_[i] = fact_[i-1] * i;
            inv_[i] = -inv_[MOD%i] * (MOD/i);
            finv_[i] = finv_[i-1] * inv_[i];
        }
    }
    constexpr T com(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[k] * finv_[n-k];
    }
    constexpr T P(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[n-k];
    }
    constexpr T fact(int n) const noexcept {
        if (n < 0) return 0;
        return fact_[n];
    }
    constexpr T inv(int n) const noexcept {
        if (n < 0) return 0;
        return inv_[n];
    }
    constexpr T finv(int n) const noexcept {
        if (n < 0) return 0;
        return finv_[n];
    }
};
 
const int MOD = 1000000007;
// const int MOD = 998244353;
using mint = Fp<MOD>;
BiCoef<mint> bc;
// bc.init(500050);

signed main(){
    int H, W;
    cin >> H >> W;
    vector<vector<int>>a(H, vector<int>(W));
    mint mul = 1;
    int zero = 0;
    REP(i, H) {
        REP(j, W) {
            cin >> a[i][j];
            if(a[i][j] == 0) {
                ++zero;
            }
            else mul *= a[i][j];
        }
    }
vector<mint>yoko(H, (mint)1), tate(W, (mint)1);
vector<int>yz(H, 0), tz(W, 0);
    REP(i, H) {
        REP(j, W) {
            if(a[i][j] == 0){
                ++yz[i];
                ++tz[j];
                continue;
            }
            tate[j] *= a[i][j];
            yoko[i] *= a[i][j];
        }
    }
    int Q;
    cin >> Q;
    vector<mint>ans;
    while(Q--) {
        int r, c;
        cin >> r >> c;
        r--; c--;
        if(zero + (a[r][c] == 0) - tz[c] - yz[r]) {
            ans.emplace_back(0);
        }else{
            ans.emplace_back(mul * (a[r][c] == 0 ? 1 : a[r][c]) / tate[c] / yoko[r]);
        }
    }
    for(auto &e:ans)cout << e << endl;
}