#958446 (C++14) No.2668 Trees on Graph Paper

提出ソース

結果

問題	No.2668 Trees on Graph Paper
ユーザー	👑 hos.lyric
提出日時	2024-03-08 21:36:10
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	484 ms / 3,000 ms
コード長	4,746 bytes
コンパイル時間	1,071 ms
コンパイル使用メモリ	109,180 KB
実行使用メモリ	120,960 KB
最終ジャッジ日時	2024-09-29 19:00:53
合計ジャッジ時間	8,858 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	79 ms 120,832 KB
testcase_01	AC	80 ms 120,832 KB
testcase_02	AC	78 ms 120,832 KB
testcase_03	AC	113 ms 120,960 KB
testcase_04	AC	81 ms 120,960 KB
testcase_05	AC	79 ms 120,960 KB
testcase_06	AC	79 ms 120,960 KB
testcase_07	AC	79 ms 120,832 KB
testcase_08	AC	79 ms 120,832 KB
testcase_09	AC	80 ms 120,960 KB
testcase_10	AC	79 ms 120,960 KB
testcase_11	AC	80 ms 120,832 KB
testcase_12	AC	79 ms 120,960 KB
testcase_13	AC	81 ms 120,960 KB
testcase_14	AC	321 ms 120,832 KB
testcase_15	AC	448 ms 120,832 KB
testcase_16	AC	265 ms 120,804 KB
testcase_17	AC	99 ms 120,960 KB
testcase_18	AC	430 ms 120,832 KB
testcase_19	AC	407 ms 120,832 KB
testcase_20	AC	406 ms 120,832 KB
testcase_21	AC	383 ms 120,960 KB
testcase_22	AC	388 ms 120,940 KB
testcase_23	AC	284 ms 120,960 KB
testcase_24	AC	482 ms 120,832 KB
testcase_25	AC	484 ms 120,960 KB
testcase_26	AC	478 ms 120,960 KB
testcase_27	AC	482 ms 120,960 KB
testcase_28	AC	80 ms 120,832 KB
testcase_29	AC	80 ms 120,960 KB
testcase_30	AC	76 ms 120,744 KB
testcase_31	AC	80 ms 120,832 KB
testcase_32	AC	79 ms 120,960 KB

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

ソースコード

raw source code

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
// Barrett
struct ModInt {
  static unsigned M;
  static unsigned long long NEG_INV_M;
  static void setM(unsigned m) { M = m; NEG_INV_M = -1ULL / M; }
  unsigned x;
  ModInt() : x(0U) {}
  ModInt(unsigned x_) : x(x_ % M) {}
  ModInt(unsigned long long x_) : x(x_ % M) {}
  ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) {
    const unsigned long long y = static_cast<unsigned long long>(x) * a.x;
    const unsigned long long q = static_cast<unsigned long long>((static_cast<unsigned __int128>(NEG_INV_M) * y) >> 64);
    const unsigned long long r = y - M * q;
    x = r - M * (r >= M);
    return *this;
  }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
unsigned ModInt::M;
unsigned long long ModInt::NEG_INV_M;
// !!!Use ModInt::setM!!!
////////////////////////////////////////////////////////////////////////////////

using Mint = ModInt;


int N, M;
Mint dp[10'000'010][3];

int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    Mint::setM(M);
    
    for (int i = 0; i <= 2*N; ++i) for (int u = 0; u < 3; ++u) dp[i][u] = 0;
    dp[0][2] = 1;
    for (int i = 1; i <= 2*N; ++i) {
      for (int u = 0; u < 3; ++u) for (int v = 0; v < 3; ++v) if (u - 1 <= v) {
        Mint f = dp[i - 1][u];
        if (u <= 0 && 1 <= v) f *= (i - 1);
        if (u <= 1 && 2 <= v) f *= i;
        dp[i][v] += f;
      }
if(i<=10){cerr<<i<<": ";pv(dp[i],dp[i]+3);}
    }
    
    Mint ans = 1;
    for (int n = 2; n <= 2*N - 2; n += 2) ans *= dp[n][0];
    for (int i = 1; i <= 2*N - 1; ++i) ans *= i;
    printf("%u\n", ans.x);
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード