結果

問題 No.1141 田グリッド
ユーザー tkmst201tkmst201
提出日時 2021-02-11 15:46:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 63 ms / 2,000 ms
コード長 4,345 bytes
コンパイル時間 2,182 ms
コンパイル使用メモリ 216,156 KB
実行使用メモリ 16,084 KB
最終ジャッジ日時 2024-07-18 04:27:31
合計ジャッジ時間 4,344 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 3 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 3 ms
5,376 KB
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 3 ms
5,376 KB
testcase_13 AC 61 ms
16,084 KB
testcase_14 AC 63 ms
15,308 KB
testcase_15 AC 33 ms
6,248 KB
testcase_16 AC 33 ms
6,272 KB
testcase_17 AC 33 ms
6,360 KB
testcase_18 AC 31 ms
6,192 KB
testcase_19 AC 34 ms
6,408 KB
testcase_20 AC 31 ms
6,276 KB
testcase_21 AC 32 ms
5,936 KB
testcase_22 AC 32 ms
5,816 KB
testcase_23 AC 33 ms
5,812 KB
testcase_24 AC 31 ms
6,068 KB
testcase_25 AC 32 ms
6,656 KB
testcase_26 AC 31 ms
6,312 KB
testcase_27 AC 32 ms
6,360 KB
testcase_28 AC 32 ms
6,656 KB
testcase_29 AC 31 ms
6,016 KB
testcase_30 AC 31 ms
6,316 KB
testcase_31 AC 31 ms
6,016 KB
testcase_32 AC 32 ms
5,944 KB
testcase_33 AC 32 ms
5,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

template<int M>
struct ModInt {
	static_assert(M > 0);
	
public:
	using value_type = int;
	using calc_type = std::int_fast64_t;
	
private:
	value_type val_;
	
public:
	constexpr ModInt(calc_type val = 0) : val_(val < 0 ? (val % M + M) % M : val % M) {}
	constexpr const value_type & val() const noexcept { return val_; }
	constexpr static decltype(M) mod() noexcept { return M; }
	
	explicit constexpr operator bool() const noexcept { return val_; }
	constexpr bool operator !() const noexcept { return !static_cast<bool>(*this); }
	constexpr ModInt operator +() const noexcept { return ModInt(*this); }
	constexpr ModInt operator -() const noexcept { return ModInt(-val_); }
	constexpr ModInt operator ++(int) noexcept { ModInt res = *this; ++*this; return res; }
	constexpr ModInt operator --(int) noexcept { ModInt res = *this; --*this; return res; }
	constexpr ModInt & operator ++() noexcept { val_ = val_ + 1 == M ? 0 : val_ + 1; return *this; }
	constexpr ModInt & operator --() noexcept { val_ = val_ == 0 ? M - 1 : val_ - 1; return *this; }
	constexpr ModInt & operator +=(const ModInt & rhs) noexcept { val_ += val_ < M - rhs.val_ ? rhs.val_ : rhs.val_ - M; return *this; }
	constexpr ModInt & operator -=(const ModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : M - rhs.val_; return *this; }
	constexpr ModInt & operator *=(const ModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % M; return *this; }
	constexpr ModInt & operator /=(const ModInt & rhs) noexcept { return *this *= rhs.inv(); }
	friend constexpr ModInt operator +(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) += rhs; }
	friend constexpr ModInt operator -(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) -= rhs; }
	friend constexpr ModInt operator *(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) *= rhs; }
	friend constexpr ModInt operator /(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) /= rhs; }
	friend constexpr bool operator ==(const ModInt & lhs, const ModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
	friend constexpr bool operator !=(const ModInt & lhs, const ModInt & rhs) noexcept { return !(lhs == rhs); }
	friend std::ostream & operator <<(std::ostream & os, const ModInt & rhs) { return os << rhs.val_; }
	friend std::istream & operator >>(std::istream & is, ModInt & rhs) { calc_type x; is >> x; rhs = ModInt(x); return is; }
	
	constexpr ModInt pow(calc_type n) const noexcept {
		ModInt res = 1, x = val_;
		if (n < 0) { x = x.inv(); n = -n; }
		while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
		return res;
	}
	
	constexpr ModInt inv() const noexcept {
		value_type a = val_, a1 = 1, a2 = 0, b = M, b1 = 0, b2 = 1;
		while (b > 0) {
			value_type q = a / b, r = a % b;
			value_type nb1 = a1 - q * b1, nb2 = a2 - q * b2;
			a = b; b = r;
			a1 = b1; b1 = nb1;
			a2 = b2; b2 = nb2;
		}
		assert(a == 1);
		return a1;
	}
};
using mint = ModInt<MOD>;

int main() {
	int H, W;
	cin >> H >> W;
	vector A(H, vector<int>(W));
	REP(i, H) REP(j, W) scanf("%d", &A[i][j]);
	
	vector<vector<mint>> prod[4];
	REP(t, 4) {
		prod[t].assign(H + 1, vector<mint>(W + 1, 1));
		REP(i, H) REP(j, W) prod[t][i + 1][j + 1] = A[i][j];
		REP(i, H + 1) REP(j, W) prod[t][i][j + 1] *= prod[t][i][j];
		REP(i, H) REP(j, W + 1) prod[t][i + 1][j] *= prod[t][i][j];
		
		auto B = A;
		A.assign(W, vector<int>(H));
		REP(i, H) REP(j, W) A[W - 1 - j][i] = B[i][j];
		swap(H, W);
	}
	
	int Q;
	cin >> Q;
	while (Q--) {
		int r, c;
		scanf("%d %d", &r, &c);
		--r; --c;
		mint ans = 1;
		REP(t, 4) {
			ans *= prod[t][r][c];
			const int nr = W - 1 - c, nc = r;
			r = nr;
			c = nc;
			swap(H, W);
		}
		printf("%d\n", ans.val());
	}
}
0