#543184 (C++17) No.1202 お菓子の食べ方

提出ソース

結果

問題	No.1202 お菓子の食べ方
ユーザー	👑 emthrm
提出日時	2020-08-29 17:19:26
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	699 ms / 2,000 ms
コード長	4,780 bytes
コンパイル時間	2,611 ms
コンパイル使用メモリ	211,220 KB
実行使用メモリ	18,944 KB
最終ジャッジ日時	2024-11-14 14:17:09
合計ジャッジ時間	21,369 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	674 ms 13,312 KB
testcase_01	AC	662 ms 10,368 KB
testcase_02	AC	690 ms 16,836 KB
testcase_03	AC	684 ms 15,472 KB
testcase_04	AC	679 ms 14,404 KB
testcase_05	AC	693 ms 16,840 KB
testcase_06	AC	688 ms 15,752 KB
testcase_07	AC	687 ms 15,436 KB
testcase_08	AC	682 ms 14,720 KB
testcase_09	AC	690 ms 16,428 KB
testcase_10	AC	27 ms 6,816 KB
testcase_11	AC	103 ms 7,808 KB
testcase_12	AC	356 ms 9,984 KB
testcase_13	AC	41 ms 6,816 KB
testcase_14	AC	354 ms 13,100 KB
testcase_15	AC	49 ms 10,960 KB
testcase_16	AC	248 ms 13,648 KB
testcase_17	AC	131 ms 11,136 KB
testcase_18	AC	104 ms 7,808 KB
testcase_19	AC	66 ms 12,768 KB
testcase_20	AC	244 ms 6,912 KB
testcase_21	AC	284 ms 14,308 KB
testcase_22	AC	85 ms 14,800 KB
testcase_23	AC	231 ms 16,040 KB
testcase_24	AC	233 ms 15,984 KB
testcase_25	AC	34 ms 6,816 KB
testcase_26	AC	310 ms 14,628 KB
testcase_27	AC	261 ms 15,660 KB
testcase_28	AC	87 ms 9,088 KB
testcase_29	AC	153 ms 15,156 KB
testcase_30	AC	2 ms 6,820 KB
testcase_31	AC	2 ms 6,820 KB
testcase_32	AC	2 ms 6,816 KB
testcase_33	AC	2 ms 6,820 KB
testcase_34	AC	2 ms 6,816 KB
testcase_35	AC	2 ms 6,816 KB
testcase_36	AC	2 ms 6,816 KB
testcase_37	AC	2 ms 6,820 KB
testcase_38	AC	2 ms 6,816 KB
testcase_39	AC	2 ms 6,820 KB
testcase_40	AC	698 ms 18,928 KB
testcase_41	AC	697 ms 18,892 KB
testcase_42	AC	697 ms 18,888 KB
testcase_43	AC	698 ms 18,944 KB
testcase_44	AC	699 ms 18,880 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(ll exponent) const {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &x) { if((val += mod - x.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod; return *this; }
  ModInt &operator/=(const ModInt &x) {
    // assert(__gcd(static_cast<int>(x.val), mod) == 1);
    unsigned a = x.val, b = mod; int u = 1, v = 0;
    while (b) {
      unsigned tmp = a / b;
      swap(a -= tmp * b, b);
      swap(u -= tmp * v, v);
    }
    return *this *= u;
  }
  bool operator==(const ModInt &x) const { return val == x.val; }
  bool operator!=(const ModInt &x) const { return val != x.val; }
  bool operator<(const ModInt &x) const { return val < x.val; }
  bool operator<=(const ModInt &x) const { return val <= x.val; }
  bool operator>(const ModInt &x) const { return val > x.val; }
  bool operator>=(const ModInt &x) const { return val >= x.val; }
  ModInt &operator++() { if (++val == mod) val = 0; return *this; }
  ModInt operator++(int) { ModInt res = *this; ++*this; return res; }
  ModInt &operator--() { val = (val == 0 ? mod : val) - 1; return *this; }
  ModInt operator--(int) { ModInt res = *this; --*this; return res; }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { return ModInt(val ? mod - val : 0); }
  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; }
  friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; }
  friend istream &operator>>(istream &is, ModInt &x) { ll val; is >> val; x = ModInt(val); return is; }
};
ModInt abs(const ModInt &x) { return x; }
struct Combinatorics {
  int val; // "val!" and "mod" must be disjoint.
  vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) const {
    if (n < 0 || k < 0) return ModInt(0);
    return k == 0 ? ModInt(1) : nCk(n + k - 1, k);
  }
};

int main() {
  int n, m; cin >> n >> m;
  vector<vector<int>> s(n, vector<int>(m));
  int mx = 0;
  REP(i, n) REP(j, m) {
    cin >> s[i][j];
    chmax(mx, s[i][j]);
  }
  Combinatorics com(mx + n - 1 + m - 1);
  function<ModInt(int, int)> solve = [&](int ub, int x) {
    return ub == -1 ? 0 : com.fact[ub + x + 1] * com.fact_inv[ub] / (x + 1);
  };
  ModInt ans = 0;
  REP(i, n) REP(j, m) {
    ans += com.fact[s[i][j] - 1 + i + j] * com.fact_inv[s[i][j] - 1] * com.fact_inv[i] * com.fact_inv[j];
    ans += (solve(s[i][j] - 1, i + j) - solve(i + 1 == n ? -1 : s[i + 1][j] - 1, i + j)) * com.fact_inv[i] * com.fact_inv[j];
    ans += (solve(s[i][j] - 1, i + j) - solve(j + 1 == m ? -1 : s[i][j + 1] - 1, i + j)) * com.fact_inv[i] * com.fact_inv[j];
  }
  cout << ans << '\n';
  return 0;
}

yukicoder

結果

テストケース

ソースコード