結果
問題 | No.1141 田グリッド |
ユーザー |
|
提出日時 | 2020-07-31 21:56:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,084 bytes |
コンパイル時間 | 2,389 ms |
コンパイル使用メモリ | 205,792 KB |
最終ジャッジ日時 | 2025-01-12 09:57:22 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 WA * 10 |
ソースコード
#include <bits/stdc++.h>#define REP(i, n) for(int i = 0;i < n;i++)#define ll long longusing namespace std;typedef pair<int, int> P;typedef pair<ll,ll> LP;const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};const int INF = 1000000000;const ll LINF = 1000000000000000000;//1e18const ll MOD = 1000000007;const ll MOD2 = 998244353;const double PI = acos(-1.0);const double EPS = 1e-10;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }//template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};/* ----------------------- DEBUG用 ---------------------------- */void debug(){ cerr << "\n"; }template <class Head, class... Tail>void debug(Head && head, Tail &&... tail){cerr << head;if(sizeof...(Tail) > 0){cerr << ", ";}debug(std::move(tail)...);}template <class T>void debug(vector<T> & vec){cerr << "{";for(int i=0;i<vec.size();i++){cerr << vec[i] << (i + 1 == vec.size() ? "" : ", ");}cerr << "}\n";}/* ----------------------- DEBUG用 ---------------------------- */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 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];}constexpr T perm(int n, int k) const noexcept {if (n < k || n < 0 || k < 0) return 0;return fact_[n] * finv_[n-k];}};using mint = Fp<MOD>;BiCoef<mint> bc;// using vec = vector<mint>;// using mat = vector<vec>;void solve(){int H, W;cin >> H >> W;vector<vector<ll>> A(H, vector<ll>(W));mint sum = 1;REP(i,H) REP(j,W){cin >> A[i][j];sum *= A[i][j];}vector<vector<mint>> cumH(H+1, vector<mint>(W+1, 1));auto cumW = cumH;REP(i,H) REP(j,W) cumH[i][j+1] = cumH[i][j] * A[i][j];REP(i,W) REP(j,H) cumW[j+1][i] = cumW[j][i] * A[j][i];int Q;cin >> Q;while(Q--){int r, c;cin >> r >> c;--r, --c;mint sub = cumH[r][W] * cumW[H][c] / A[r][c];cout << sum / sub << endl;}}int main(){cin.tie(0);ios::sync_with_stdio(false);solve();// int T; cin >> T; REP(t,T) solve();}