結果

問題 No.1141 田グリッド
コンテスト
ユーザー Ricky_pon
提出日時 2020-07-31 21:44:02
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,929 bytes
コンパイル時間 2,092 ms
コンパイル使用メモリ 199,804 KB
最終ジャッジ日時 2025-01-12 09:40:01
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 24 WA * 7
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:129:19: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 2 has type ‘mint*’ {aka ‘modint<1000000007>*’} [-Wformat=]
  129 |         scanf("%lld", &a[i][j]);
      |                ~~~^   ~~~~~~~~
      |                   |   |
      |                   |   mint* {aka modint<1000000007>*}
      |                   long long int*
main.cpp:159:25: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘modint<1000000007>::i64’ {aka ‘long int’} [-Wformat=]
  159 |         else printf("%lld\n", (mul / row[r] / col[c] * a[r][c]).a);
      |                      ~~~^     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                         |                                       |
      |                         long long int                           modint<1000000007>::i64 {aka long int}
      |                      %ld
main.cpp:125:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  125 |     scanf("%d%d", &h, &w);
      |     ~~~~~^~~~~~~~~~~~~~~~
main.cpp:129:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  129 |         scanf("%lld", &a[i][j]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~
main.cpp:153:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  153 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
main.cpp:156:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  156 |         scanf("%d%d", &r, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~

ソースコード

diff # 

#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 500010;

template<int_fast64_t MOD> struct modint{
    using i64=int_fast64_t;
    i64 a;
    modint(const i64 a_=0): a(a_){
        if(a>MOD) a%=MOD;
        else if(a<0) (a%=MOD)+=MOD;
    }
    modint inv(){
        i64 t=1, n=MOD-2, x=a;
        while(n){
            if(n&1) (t*=x)%=MOD;
            (x*=x)%=MOD;
            n>>=1;
        }
        modint ret(t);
        return ret;
    }
    bool operator==(const modint x) const{return a==x.a;}
    bool operator!=(const modint x) const{return a!=x.a;}
    modint operator+(const modint x) const{
        return modint(*this)+=x;
    }
    modint operator-(const modint x) const{
        return modint(*this)-=x;
    }
    modint operator*(const modint x) const{
        return modint(*this)*=x;
    }
    modint operator/(const modint x) const{
        return modint(*this)/=x;
    }
    modint operator^(const lint x) const{
        return modint(*this)^=x;
    }
    modint &operator+=(const modint &x){
        a+=x.a;
        if(a>=MOD) a-=MOD;
        return *this;
    }
    modint &operator-=(const modint &x){
        a-=x.a;
        if(a<0) a+=MOD;
        return *this;
    }
    modint &operator*=(const modint &x){
        (a*=x.a)%=MOD;
        return *this;
    }
    modint &operator/=(modint x){
        (a*=x.inv().a)%=MOD;
        return *this;
    }
    modint &operator^=(lint n){
        i64 ret=1;
        while(n){
            if(n&1) (ret*=a)%=MOD;
            (a*=a)%=MOD;
            n>>=1;
        }
        a=ret;
        return *this;
    }
    modint operator-() const{
        return modint(0)-*this;
    }
    modint &operator++(){
        return *this+=1;
    }
    modint &operator--(){
        return *this-=1;
    }
    bool operator<(const modint x) const{
        return a<x.a;
    }
};

using mint=modint<1000000007>;

vector<mint> fact;
vector<mint> revfact;

void setfact(int n){
    fact.resize(n+1); revfact.resize(n+1);
    fact[0] = 1;
    rep(i, n) fact[i+1] = fact[i] * mint(i+1);

    revfact[n] = fact[n].inv();
    for(int i=n-1; i>=0; i--) revfact[i] = revfact[i+1] * mint(i+1);
}

mint getC(int n, int r){
    if(n<r) return 0;
    return fact[n] * revfact[r] * revfact[n-r];
}

int main(){
    int h, w;
    scanf("%d%d", &h, &w);
    mint a[h][w], mul = 1;
    int zero = 0;
    rep(i, h)rep(j, w){
        scanf("%lld", &a[i][j]);
        if(a[i][j] != 0) mul *= a[i][j];
        else ++zero;
    }
    mint row[h], col[w];
    int rz[h], cz[w];
    rep(i, h){
        row[i] = 1;
        rz[i] = 0;
        rep(j, w){
            if(a[i][j] != 0) row[i] *= a[i][j];
            else ++rz[i];
        }
    }
    rep(j, w){
        col[j] = 1;
        cz[j] = 0;
        rep(i, h){
            if(a[i][j] != 0) col[j] *= a[i][j];
            else ++cz[j];
        }
    }

    int q;
    scanf("%d", &q);
    rep(_, q){
        int r, c;
        scanf("%d%d", &r, &c);
        --r; --c;
        if(zero - rz[r] - cz[c] + (a[r][c] == 0)) printf("%d\n", 0);
        else printf("%lld\n", (mul / row[r] / col[c] * a[r][c]).a);
    }
}
0