#542721 (C++14) No.1202 お菓子の食べ方

• 問題: No.1202 お菓子の食べ方
• ユーザー: carrot46
• 提出日時: 2020-08-29 00:22:18
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,080 ms / 2,000 ms
• コード長: 2,981 bytes
• コンパイル時間: 1,820 ms
• コンパイル使用メモリ: 176,336 KB
• 実行使用メモリ: 26,900 KB
• 最終ジャッジ日時: 2024-11-14 03:55:09
• 合計ジャッジ時間: 29,824 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
other	AC * 45

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);
template <unsigned long long mod > class modint{
public:
    ll x;
    modint(){x = 0;}
    modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}
    modint operator-(){
        return x == 0 ? 0 : mod - x;
    }
    modint& operator+=(const modint& a){
        if((x += a.x) >= mod) x -= mod;
        return *this;
    }
    modint operator+(const modint& a) const{
        return modint(*this) += a;
    }
    modint& operator-=(const modint& a){
        if((x -= a.x) < 0) x += mod;
        return *this;
    }
    modint operator-(const modint& a) const{
        return modint(*this) -= a;
    }
    modint& operator*=(const modint& a){
        (x *= a.x)%=mod;
        return *this;
    }
    modint operator*(const modint& a) const{
        return modint(*this) *= a;
    }
    modint pow(unsigned long long pw) const{
        modint res(1), comp(*this);
        while(pw){
            if(pw&1) res *= comp;
            comp *= comp;
            pw >>= 1;
        }
        return res;
    }
    //以下、modが素数のときのみ
    modint inv() const{
        return modint(*this).pow(mod - 2);
    }
    modint& operator/=(const modint &a){
        (x *= a.inv().x)%=mod;
        return *this;
    }
    modint operator/(const modint &a) const{
        return modint(*this) /= a;
    }
};
#define mod1 998244353
#define mod2 1000000007
using mint = modint<mod2>;
ostream& operator<<(ostream& os, const mint& a){
    os << a.x;
    return os;
}
using vm = vector<mint>;
const ll MAX_N = ll(1e+6) + 3000;
vm fact(MAX_N, mint(1)), fact_inv(MAX_N, mint(1));
void makefact(){
    reps(i,2,MAX_N) {
        fact[i] = fact[i-1] * mint(i);
        fact_inv[i] = fact[i].inv();
    }
}
mint nCm(ll n, ll m){
    return fact[n] * fact_inv[n-m] * fact_inv[m];
}
mint nCm_inv(ll n, ll m){
    return fact[n-m] * fact[m] * fact_inv[n];
}
mint f(int i, int j, ll a){
    if(a == 0) return mint(0);
    mint res(a);
    res *= fact[a + i + j];
    res /= i + j + 1;
    res *= fact_inv[a];
    return res;
}
int main() {
    makefact();
    cin>>N>>M;
    mat s(N + 1, vec(M + 1, 0));
    rep(i, N) rep(j, M) cin>>s[i][j];
    mint ans(0);
    rep(i, N){
        rep(j, M){
            mint temp(0);
            temp += f(i, j, s[i][j]) * 3;
            temp -= f(i, j, s[i + 1][j]) + f(i, j, s[i][j + 1]) + f(i, j, s[i][j] - 1);
            temp *= fact_inv[i] * fact_inv[j];
            ans += temp;
        }
    }
    cout<<ans<<endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX