結果
問題 |
No.1141 田グリッド
|
ユーザー |
![]() |
提出日時 | 2020-08-01 16:31:21 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 4,198 bytes |
コンパイル時間 | 2,362 ms |
コンパイル使用メモリ | 208,416 KB |
最終ジャッジ日時 | 2025-01-12 12:43:50 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef vector<ll> vl; typedef vector<vector<ll>> vvl; //typedef vector<vector<ll>> Graph; const ll mod = 1e9 + 7; //const ll mod = 998244353; #define REP(i,n) for(ll i=0;i<(ll)n;i++) #define dump(x) cerr << #x << " = " << (x) << endl; #define spa << " " << #define fi first #define se second template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){ os << "(" << v.first << ", " << v.second << ")"; return os; } template<class T> ostream& operator << (ostream& os, const vector<T> v){ for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os; } template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){ for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os; } template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0]; for(ll i=1;i<n;i++)cerr spa v[i]; cerr<<endl;}; template <std::uint_fast64_t Modulus> class modint { // long long から modint を作るときは必ず正の数にしてからコンストラクタに入れること! // そうしないとバグります using u64 = std::uint_fast64_t; public: u64 a; constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {} constexpr u64 &value() noexcept { return a; } constexpr const u64 &value() const noexcept { return a; } constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; } constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; } constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; } constexpr modint operator/(const modint rhs) const noexcept { return modint(*this) /= rhs; } constexpr modint &operator+=(const modint rhs) noexcept { a += rhs.a; if (a >= Modulus) { a -= Modulus; } return *this; } constexpr modint &operator-=(const modint rhs) noexcept { if (a < rhs.a) { a += Modulus; } a -= rhs.a; return *this; } constexpr modint &operator*=(const modint rhs) noexcept { a = a * rhs.a % Modulus; return *this; } constexpr modint &operator/=(modint rhs) noexcept { u64 exp = Modulus - 2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } }; using mint = modint<mod>; template <class T, class U> constexpr T power(T x, U exp) { T ret = static_cast<T>(1); while (exp) { if (exp % static_cast<U>(2) == static_cast<U>(1)) ret *= x; exp /= static_cast<U>(2); x *= x; } return ::std::move(ret); } using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; int main(){ cin.tie(0); ios::sync_with_stdio(false); ll H, W; cin >> H >> W; vvl A(H, vl(W, 0)); REP(i, H){ REP(j, W){ cin >> A[i][j]; } } vvvm B(4, vvm(H, vm(W, 0))); REP(i, H)REP(j, W){ B[0][i][j] = A[i][j]; B[1][i][j] = A[H-1-i][j]; B[2][i][j] = A[i][W-1-j]; B[3][i][j] = A[H-1-i][W-1-j]; } vvvm S; auto cum2d = [&](vvm &x){ vvm cum(H+1, vm(W+1, 1)); REP(i, H)REP(j, W) cum[i+1][j+1] = cum[i+1][j] * x[i][j]; REP(i, H)REP(j, W) cum[i+1][j+1] *= cum[i][j+1]; return cum; }; REP(i, 4) S.push_back(cum2d(B[i])); ll Q; cin >> Q; while(Q--){ ll r, c; cin >> r >> c; r--, c--; mint res = 1; res *= S[0][r][c]; res *= S[1][H-1-r][c]; res *= S[2][r][W-1-c]; res *= S[3][H-1-r][W-1-c]; cout << res.value() << "\n"; } return 0; }