結果
問題 | No.886 Direct |
ユーザー | minato |
提出日時 | 2021-01-11 16:15:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 131 ms / 4,000 ms |
コード長 | 10,451 bytes |
コンパイル時間 | 3,879 ms |
コンパイル使用メモリ | 230,344 KB |
実行使用メモリ | 27,096 KB |
最終ジャッジ日時 | 2024-11-21 09:14:54 |
合計ジャッジ時間 | 8,679 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 118 ms
27,008 KB |
testcase_01 | AC | 117 ms
26,912 KB |
testcase_02 | AC | 118 ms
26,880 KB |
testcase_03 | AC | 114 ms
27,008 KB |
testcase_04 | AC | 114 ms
26,880 KB |
testcase_05 | AC | 123 ms
26,880 KB |
testcase_06 | AC | 124 ms
27,008 KB |
testcase_07 | AC | 115 ms
27,008 KB |
testcase_08 | AC | 118 ms
27,008 KB |
testcase_09 | AC | 118 ms
27,008 KB |
testcase_10 | AC | 114 ms
27,000 KB |
testcase_11 | AC | 123 ms
26,880 KB |
testcase_12 | AC | 121 ms
26,980 KB |
testcase_13 | AC | 121 ms
27,016 KB |
testcase_14 | AC | 117 ms
26,908 KB |
testcase_15 | AC | 116 ms
27,008 KB |
testcase_16 | AC | 122 ms
27,092 KB |
testcase_17 | AC | 123 ms
27,096 KB |
testcase_18 | AC | 123 ms
27,008 KB |
testcase_19 | AC | 115 ms
26,980 KB |
testcase_20 | AC | 115 ms
26,912 KB |
testcase_21 | AC | 116 ms
27,008 KB |
testcase_22 | AC | 120 ms
26,980 KB |
testcase_23 | AC | 119 ms
26,880 KB |
testcase_24 | AC | 123 ms
26,976 KB |
testcase_25 | AC | 122 ms
27,008 KB |
testcase_26 | AC | 118 ms
26,908 KB |
testcase_27 | AC | 130 ms
26,972 KB |
testcase_28 | AC | 128 ms
26,880 KB |
testcase_29 | AC | 118 ms
26,984 KB |
testcase_30 | AC | 124 ms
27,008 KB |
testcase_31 | AC | 128 ms
26,988 KB |
testcase_32 | AC | 128 ms
27,008 KB |
testcase_33 | AC | 130 ms
27,008 KB |
testcase_34 | AC | 131 ms
27,008 KB |
testcase_35 | AC | 129 ms
26,972 KB |
ソースコード
#pragma GCC target("avx2,avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using i128 = __int128_t; using pii = pair<int, int>; using pll = pair<long long, long long>; template<class T> using vec = vector<T>; template<class T> using vvec = vector<vector<T>>; #define rep(i, n) for (int i = 0; i < (n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define all(x) (x).begin(), (x).end() constexpr char ln = '\n'; istream& operator>>(istream& is, __int128_t& x) { x = 0; string s; is >> s; int n = int(s.size()), it = 0; if (s[0] == '-') it++; for (; it < n; it++) x = (x * 10 + s[it] - '0'); if (s[0] == '-') x = -x; return is; } ostream& operator<<(ostream& os, __int128_t x) { if (x == 0) return os << 0; if (x < 0) os << '-', x = -x; deque<int> deq; while (x) deq.emplace_front(x % 10), x /= 10; for (int e : deq) os << e; return os; } template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << "(" << p.first << ", " << p.second << ")"; } template<class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; for (int i = 0; i < int(v.size()); i++) { if (i) os << ", "; os << v[i]; } return os << "}"; } template<class Container> inline int SZ(Container& v) { return int(v.size()); } template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); } template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;} template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;} inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); } inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); } inline int popcount(ull x) { return __builtin_popcountll(x); } inline int kthbit(ull x, int k) { return (x>>k) & 1; } inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; } inline void print() { cout << "\n"; } template<class T> inline void print(const vector<T>& v) { for (int i = 0; i < int(v.size()); i++) { if (i) cout << " "; cout << v[i]; } print(); } template<class T, class... Args> inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); } #ifdef MINATO_LOCAL inline void debug_out() { cerr << endl; } template <class T, class... Args> inline void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); } #define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// //O(NloglogN) で約数・倍数の畳み込み // divisor_zeta : 倍数方向に高速ゼータ変換(累積和) // divisor_moebius : その逆 // multiple_zeta : 約数方向に高速ゼータ変換(累積和) // multiple_moebius : その逆 struct prime_zeta { int n_; vector<bool> sieve; prime_zeta() {} prime_zeta(int n) : n_(n), sieve(n+1, true) { sieve[0] = sieve[1] = false; for (int i = 2; i*i <= n; i++) { if (sieve[i]) { for (int j = i*i; j <= n; j += i) { sieve[j] = false; } } } } template<class T> void divisor_zeta(T &c) { int n = int(c.size()); assert(n <= n_); for (int i = 2; i < n; i++) { if (sieve[i]) { for (int j = 1; j*i < n; j++) { c[j*i] += c[j]; } } } } template<class T> void divisor_moebius(T &c) { int n = int(c.size()); assert(n <= n_); for (int i = 2; i < n; i++) { if (sieve[i]) { for (int j = (n-1)/i; j >= 1; j--) { c[j*i] -= c[j]; } } } } template<class T> void multiple_zeta(T &c) { int n = int(c.size()); assert(n <= n_); for (int i = 2; i < n; i++) { if (sieve[i]) { for (int j = (n-1)/i; j >= 1; j--) { c[j] += c[j*i]; } } } } template<class T> void multiple_moebius(T &c) { int n = int(c.size()); assert(n <= n_); for (int i = 2; i < n; i++) { if (sieve[i]) { for (int j = 1; j*i < n; j++) { c[j] -= c[j*i]; } } } } }; template<int m> struct ModInt { public: static constexpr int mod() { return m; } static ModInt raw(int v) { ModInt x; x._v = v; return x; } ModInt() : _v(0) {} ModInt(long long v) { long long x = (long long)(v % (long long)(umod())); if (x < 0) x += umod(); _v = (unsigned int)(x); } unsigned int val() const { return _v; } ModInt& operator++() { _v++; if (_v == umod()) _v = 0; return *this; } ModInt& operator--() { if (_v == 0) _v = umod(); _v--; return *this; } ModInt operator++(int) { ModInt result = *this; ++*this; return result; } ModInt operator--(int) { ModInt result = *this; --*this; return result; } ModInt& operator+=(const ModInt& rhs) { _v += rhs._v; if (_v >= umod()) _v -= umod(); return *this; } ModInt& operator-=(const ModInt& rhs) { _v -= rhs._v; if (_v >= umod()) _v += umod(); return *this; } ModInt& operator*=(const ModInt& rhs) { unsigned long long z = _v; z *= rhs._v; _v = (unsigned int)(z % umod()); return *this; } ModInt& operator^=(long long n) { ModInt x = *this; *this = 1; if (n < 0) x = x.inv(), n = -n; while (n) { if (n & 1) *this *= x; x *= x; n >>= 1; } return *this; } ModInt& operator/=(const ModInt& rhs) { return *this = *this * rhs.inv(); } ModInt operator+() const { return *this; } ModInt operator-() const { return ModInt() - *this; } ModInt pow(long long n) const { ModInt r = *this; r ^= n; return r; } ModInt inv() const { int a = _v, b = umod(), y = 1, z = 0, t; for (; ; ) { t = a / b; a -= t * b; if (a == 0) { assert(b == 1 || b == -1); return ModInt(b * z); } y -= t * z; t = b / a; b -= t * a; if (b == 0) { assert(a == 1 || a == -1); return ModInt(a * y); } z -= t * y; } } friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) += rhs; } friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) -= rhs; } friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) *= rhs; } friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) /= rhs; } friend ModInt operator^(const ModInt& lhs, long long rhs) { return ModInt(lhs) ^= rhs; } friend bool operator==(const ModInt& lhs, const ModInt& rhs) { return lhs._v == rhs._v; } friend bool operator!=(const ModInt& lhs, const ModInt& rhs) { return lhs._v != rhs._v; } friend ModInt operator+(long long lhs, const ModInt& rhs) { return (ModInt(lhs) += rhs); } friend ModInt operator-(long long lhs, const ModInt& rhs) { return (ModInt(lhs) -= rhs); } friend ModInt operator*(long long lhs, const ModInt& rhs) { return (ModInt(lhs) *= rhs); } friend ostream& operator<<(ostream& os, const ModInt& M) { return os << M._v; } friend istream& operator>>(istream& is, ModInt& M) { long long x; is >> x; M = ModInt(x); return is; } private: unsigned int _v; static constexpr unsigned int umod() { return m; } }; constexpr int MOD = 1000000007; //constexpr int MOD = 998244353; using mint = ModInt<MOD>; struct ModCombination { private: int max_n; vector<mint> fac_,facinv_; public: ModCombination() {} ModCombination(int n) : max_n(n), fac_(n+1), facinv_(n+1) { assert(1 <= n); fac_[0] = 1; for (int i = 1; i <= n; i++) fac_[i] = fac_[i-1]*i; facinv_[n] = fac_[n].inv(); for (int i = n; i >= 1; i--) facinv_[i-1] = facinv_[i]*i; } mint fac(int k) const { assert(0 <= k and k <= max_n); return fac_[k]; } mint facinv(int k) const { assert(0 <= k and k <= max_n); return facinv_[k]; } mint invs(int k) const { assert(1 <= k and k <= max_n); return facinv_[k]*fac_[k-1]; } mint P(int n, int k) const { if (k < 0 or k > n) return mint(0); assert(n <= max_n); return fac_[n]*facinv_[n-k]; } mint C(int n, int k) const { if (k < 0 or k > n) return mint(0); assert(n <= max_n); return fac_[n]*facinv_[n-k]*facinv_[k]; } mint H(int n, int k) const { if (n == 0 and k == 0) return mint(1); return C(n+k-1,k); } mint catalan(int n) const { if (n == 0) return mint(1); return C(n*2,n) - C(n*2,n-1); } }; int main() { int H,W; cin >> H >> W; const int MAX = 3e6; prime_zeta zet(MAX); vec<mint> cnt(MAX); for (int i = 1; i < H; i++) { cnt[i] = H-i; } zet.multiple_zeta(cnt); vec<mint> e(MAX); e[1] = 1; zet.divisor_moebius(e); rep(i,MAX) { cnt[i] *= e[i]; } zet.divisor_zeta(cnt); mint ans = 0; for (int i = 1; i < W; i++) { ans += cnt[i]*(W-i); } ans *= 2; ans += mint(H)*(W-1) + mint(W)*(H-1); cout << ans << ln; }