結果

問題 No.1141 田グリッド
ユーザー tanimani364tanimani364
提出日時 2021-04-01 03:48:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,612 bytes
コンパイル時間 2,070 ms
コンパイル使用メモリ 214,936 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-05-09 14:59:34
合計ジャッジ時間 4,471 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 3 ms
6,940 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 3 ms
6,944 KB
testcase_11 AC 3 ms
6,944 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 46 ms
6,940 KB
testcase_14 AC 53 ms
6,940 KB
testcase_15 AC 46 ms
6,940 KB
testcase_16 AC 45 ms
6,940 KB
testcase_17 AC 45 ms
6,940 KB
testcase_18 AC 25 ms
6,940 KB
testcase_19 AC 25 ms
6,940 KB
testcase_20 AC 25 ms
6,940 KB
testcase_21 AC 48 ms
6,940 KB
testcase_22 AC 47 ms
6,944 KB
testcase_23 AC 46 ms
6,940 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 25 ms
6,940 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 25 ms
6,940 KB
testcase_33 AC 24 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x %= p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}

    Modint &operator+=(const Modint &p){
			if((x+=p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator-=(const Modint &p){
			if((x+=mod-p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator*=(const Modint &p){
			x = (1LL * x * p.x) % mod;
			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 = mod, u = 1, v = 0;
			while(b>0){
				int t = a / b;
				swap(a -= t * b, b);
				swap(u -= t * v, v);
			}
			return Modint(u);
		}

		Modint pow(int64_t n) const{//繰り返し二乗法
			Modint ret(1), mul(x);
			while(n>0){
				if(n&1)
					ret *= mul;
				mul *= mul;
				n >>= 1;
			}
			return ret;
		}

		friend ostream &operator<<(ostream &os,const Modint &p){
			return os << p.x;
		}
};

using modint = Modint<mod>;
using modint2= Modint<mod_998244353>;

template<typename T>
struct Combination{
  //Modint用
  //構築O(N),クエリO(1)
	vector<T>fact,rfact;

	Combination(int n):fact(n+1),rfact(n+1){
		fact[0]=1;fact[1]=1;
		rfact[n]=1;
		for(int i=2;i<=n;++i){
			fact[i]=fact[i-1]*i;
		}
		rfact[n]/=fact[n];
		for(int i=n-1;i>=0;--i){
			rfact[i]=rfact[i+1]*(i+1);
		}
	}

	T C(int n,int r) const{
		if(r==0)return 1;
		if(r<0 || n<r)return 0;
		return fact[n]*rfact[n-r]*rfact[r];
	}
};

void solve()
{	
	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<modint>r(h,1),c(w,1);
	vector<int>zero_r(h),zero_c(w);
	rep(i,h){
		rep(j,w){
			if(a[i][j])r[i]*=a[i][j];
			else zero_r[i]=1;
		}
	}
	rep(i,w){
		rep(j,h){
			if(a[j][i])c[i]*=a[j][i];
			else zero_c[i]=1;
		}
	}
	modint res=1;
	rep(i,h)rep(j,w)if(a[i][j])res*=a[i][j];
	int cnt_r=0,cnt_c=0;
	cnt_r=accumulate(all(zero_r),0);
	cnt_c=accumulate(all(zero_c),0);

	int q;
	cin>>q;
	while(q--){
		int x,y;
		cin>>x>>y;
		x--;y--;
		modint ans=res;
		if(cnt_r==0){
			ans/=r[x];
			ans/=c[y];
			ans*=a[x][y];
		}else if(cnt_r>2&&cnt_c>2){
			ans=0;
		}else if(cnt_r==1&&zero_r[x]){
			ans/=r[x];
			ans/=c[y];
			ans*=a[x][y];
		}else if(cnt_c==1&&zero_c[y]){
			ans/=r[x];
			ans/=c[y];
			ans*=a[x][y];
		}else if(cnt_r==2&&zero_r[x]&&zero_c[y]){
			ans/=r[x];
			ans/=c[y];
			ans*=a[x][y];
		}else{
			ans=0;
		}
		
		cout<<ans<<"\n";
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}
0