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

• 問題: No.1141 田グリッド
• ユーザー: first_vil
• 提出日時: 2020-07-31 22:39:06
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 76 ms / 2,000 ms
• コード長: 6,757 bytes
• コンパイル時間: 2,022 ms
• コンパイル使用メモリ: 214,360 KB
• 実行使用メモリ: 14,208 KB
• 最終ジャッジ日時: 2024-07-06 19:54:47
• 合計ジャッジ時間: 4,240 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	2 ms; 6,944 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	2 ms; 6,944 KB
testcase_08	AC	2 ms; 6,944 KB
testcase_09	AC	2 ms; 6,944 KB
testcase_10	AC	2 ms; 6,940 KB
testcase_11	AC	3 ms; 6,944 KB
testcase_12	AC	3 ms; 6,944 KB
testcase_13	AC	58 ms; 6,940 KB
testcase_14	AC	76 ms; 14,208 KB
testcase_15	AC	65 ms; 6,940 KB
testcase_16	AC	64 ms; 6,940 KB
testcase_17	AC	65 ms; 6,940 KB
testcase_18	AC	23 ms; 6,940 KB
testcase_19	AC	23 ms; 6,940 KB
testcase_20	AC	23 ms; 6,940 KB
testcase_21	AC	64 ms; 6,944 KB
testcase_22	AC	65 ms; 6,940 KB
testcase_23	AC	64 ms; 6,940 KB
testcase_24	AC	23 ms; 6,944 KB
testcase_25	AC	24 ms; 6,944 KB
testcase_26	AC	23 ms; 6,940 KB
testcase_27	AC	24 ms; 6,944 KB
testcase_28	AC	24 ms; 6,940 KB
testcase_29	AC	24 ms; 6,944 KB
testcase_30	AC	23 ms; 6,944 KB
testcase_31	AC	23 ms; 6,944 KB
testcase_32	AC	23 ms; 6,944 KB
testcase_33	AC	24 ms; 6,940 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define each(i, a) for(auto &i : a)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }

template<int modulo> struct ModInt {
    int x;

    ModInt() : x(0) {}
    ModInt(ll y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}

    ModInt& operator+=(const ModInt& p) {
        if ((x += p.x) >= modulo) x -= modulo;
        return *this;
    }
    ModInt& operator-=(const ModInt& p) {
        if ((x += modulo - p.x) >= modulo) x -= modulo;
        return *this;
    }
    ModInt& operator*=(const ModInt& p) {
        x = (int)(1LL * x * p.x % modulo);
        return *this;
    }
    ModInt& operator/=(const ModInt& p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt& p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt& p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt& p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt& p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt& p) const { return x == p.x; }
    bool operator!=(const ModInt& p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = modulo, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }

    ModInt pow(ll e) {
        ll a = 1, p = x;
        while (e > 0) {
            if (e % 2 == 0) {
                p = (p * p) % modulo;
                e /= 2;
            }
            else {
                a = (a * p) % modulo;
                e--;
            }
        }
        return ModInt(a);
    }

    friend ostream& operator<<(ostream& os, const ModInt<modulo>& p) {
        return os << p.x;
    }
    friend istream& operator>>(istream& is, ModInt<modulo>& a) {
        ll x;
        is >> x;
        a = ModInt<modulo>(x);
        return (is);
    }
};
using modint = ModInt<mod>;

template<class T> class acc2d {
    int h, w;
    vector<vector<T>> dat;
public:
    acc2d(int _h, int _w) : h(_h), w(_w) {
        dat = vec<T>(h, w);
    };
    acc2d(vector<vector<T>>& _dat) : dat(_dat), h(_dat.size()), w(_dat[0].size()) {
        build();
    }
    void build() {
        FOR(i, 0, h)FOR(j, 1, w)dat[i][j] += dat[i][j - 1];
        FOR(i, 1, h)FOR(j, 0, w)dat[i][j] += dat[i - 1][j];
    }
    T sum(int y1, int x1, int y2, int x2) {
        T ret = dat[y2][x2];
        if (0 < y1)ret -= dat[y1 - 1][x2];
        if (0 < x1)ret -= dat[y2][x1 - 1];
        if (0 < y1 && 0 < x1)ret += dat[y1 - 1][x1 - 1];
        return ret;
    }
    T sum(int y2, int x2) { return sum(0, 0, y2, x2); }
    vector<T>& operator[](int i) { return dat[i]; }
};
template<class T> class acc2d2 {
    int h, w;
    vector<vector<T>> dat;
public:
    acc2d2(int _h, int _w) : h(_h), w(_w) {
        dat = vec<T>(h, w);
    };
    acc2d2(vector<vector<T>>& _dat) : dat(_dat), h(_dat.size()), w(_dat[0].size()) {
        build();
    }
    void build() {
        FOR(i, 0, h)FOR(j, 1, w)dat[i][j] *= dat[i][j - 1];
        FOR(i, 1, h)FOR(j, 0, w)dat[i][j] *= dat[i - 1][j];
    }
    T mul(int y1, int x1, int y2, int x2) {
        T ret = dat[y2][x2];
        if (0 < y1)ret /= dat[y1 - 1][x2];
        if (0 < x1)ret /= dat[y2][x1 - 1];
        if (0 < y1 && 0 < x1)ret *= dat[y1 - 1][x1 - 1];
        return ret;
    }
    T mul(int y2, int x2) { return mul(0, 0, y2, x2); }
    vector<T>& operator[](int i) { return dat[i]; }
};

int main() {
    init();

    int h, w; cin >> h >> w;
    auto a = vec<modint>(h, w); cin >> a;
    auto b = vec<int>(h, w);
    FOR(i, 0, h)FOR(j, 0, w) {
        if (a[i][j] == 0)a[i][j] = b[i][j] = 1;
    }
    acc2d2<modint> acc(a);
    acc2d<int> cca(b);
    int q; cin >> q;
    while (q--) {
        int r, c; cin >> r >> c;
        --r, --c;
        if (cca.sum(h - 1, w - 1) - cca.sum(r, 0, r, w - 1)
            - cca.sum(0, c, h - 1, c) + b[r][c])
            print(0);
        else print(acc.mul(h - 1, w - 1) / acc.mul(r, 0, r, w - 1)
            / acc.mul(0, c, h - 1, c) * a[r][c]);
    }

    return 0;
}