結果
問題 | No.1141 田グリッド |
ユーザー | cn_449 |
提出日時 | 2020-07-31 21:39:56 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 189 ms / 2,000 ms |
コード長 | 3,705 bytes |
コンパイル時間 | 1,934 ms |
コンパイル使用メモリ | 137,284 KB |
最終ジャッジ日時 | 2025-01-12 09:31:13 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
#include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <string> #include <queue> #include <stack> #include <set> #include <map> #include <iomanip> #include <utility> #include <tuple> #include <functional> #include <bitset> #include <cassert> #include <complex> #include <stdio.h> #include <time.h> #include <numeric> #include <random> #include <unordered_map> #include <unordered_set> #define all(a) a.begin(),a.end() #define rep(i, n) for (ll i = 0; i < (n); i++) #define pb push_back #define debug(x) cerr << #x << ':' << x << '\n' #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> P; typedef complex<ld> com; constexpr int inf = 1000000010; constexpr ll INF = 1000000000000000010; constexpr ld eps = 1e-12; constexpr ld pi = 3.141592653589793238; template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; } template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; } constexpr ll mod = 1000000007; vector<ll> fac, inv, facinv; void modcalc(int modsize) { fac.resize(modsize); inv.resize(modsize); facinv.resize(modsize); fac[0] = 1; fac[1] = 1; inv[1] = 1; facinv[0] = 1; facinv[1] = 1; for (ll i = 2; i < modsize; i++) { fac[i] = fac[i - 1] * i % mod; inv[i] = mod - inv[mod % i] * (mod / i) % mod; facinv[i] = facinv[i - 1] * inv[i] % mod; } } ll modinv(ll a) { a %= mod; if (a == 0) abort(); if (a < (ll)inv.size()) return inv[a]; ll b = mod, u = 1, v = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= mod; if (u < 0) u += mod; return u; } ll modpow(ll a, ll b, ll m = mod) { ll ans = 1; a %= m; while (b) { if (b & 1) ans = ans * a % m; a = a * a % m; b >>= 1; } return ans; } ll modcomb(ll n, ll k) { if (n < 0 || k < 0 || n < k) return 0; return fac[n] * facinv[k] % mod * facinv[n - k] % mod; } ll modperm(ll n, ll k) { if (n < 0 || k < 0 || n < k) return 0; return fac[n] * facinv[n - k] % mod; } ll modhom(ll n, ll k) { if (n < 0 || k < 0 || n == 0 && k > 0) return 0; if (n == 0 && k == 0) return 1; return fac[n + k - 1] * facinv[k] % mod * facinv[n - 1] % mod; } int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); int h, w; cin >> h >> w; vector<vector<ll>> a(h, vector<ll>(w)); rep(i, h) rep(j, w) cin >> a[i][j]; vector<vector<ll>> x1(h + 2, vector<ll>(w + 2, 1)); rep(i, h) rep(j, w) { if (!x1[i][j]) x1[i + 1][j + 1] = 0; else x1[i + 1][j + 1] = x1[i + 1][j] * x1[i][j + 1] % mod * modinv(x1[i][j]) % mod * a[i][j] % mod; } vector<vector<ll>> x2(h + 2, vector<ll>(w + 2, 1)); rep(i, h) for (int j = w + 1; j >= 2; j--) { if (!x2[i][j]) x2[i + 1][j - 1] = 0; else x2[i + 1][j - 1] = x2[i + 1][j] * x2[i][j - 1] % mod * modinv(x2[i][j]) % mod * a[i][j - 2] % mod; } vector<vector<ll>> x3(h + 2, vector<ll>(w + 2, 1)); for (int i = h + 1; i >= 2; i--) rep(j, w) { if (!x3[i][j]) x3[i - 1][j + 1] = 0; else x3[i - 1][j + 1] = x3[i - 1][j] * x3[i][j + 1] % mod * modinv(x3[i][j]) % mod * a[i - 2][j] % mod; } vector<vector<ll>> x4(h + 2, vector<ll>(w + 2, 1)); for (int i = h + 1; i >= 2; i--)for (int j = w + 1; j >= 2; j--) { if (!x4[i][j]) x4[i - 1][j - 1] = 0; else x4[i - 1][j - 1] = x4[i - 1][j] * x4[i][j - 1] % mod * modinv(x4[i][j]) % mod * a[i - 2][j - 2] % mod; } int q; cin >> q; while (q--) { int r, c; cin >> r >> c; cout << x1[r - 1][c - 1] * x2[r - 1][c + 1] % mod * x3[r + 1][c - 1] % mod * x4[r + 1][c + 1] % mod << '\n'; } }