結果
| 問題 | No.886 Direct |
| ユーザー |
 hitonanode
|
| 提出日時 | 2019-09-28 16:54:50 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 573 ms / 4,000 ms |
| コード長 | 6,977 bytes |
| コンパイル時間 | 1,938 ms |
| コンパイル使用メモリ | 172,380 KB |
| 実行使用メモリ | 38,440 KB |
| 最終ジャッジ日時 | 2024-10-02 12:07:03 |
| 合計ジャッジ時間 | 8,066 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 32 |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long int;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define SZ(x) ((lint)(x).size())#define POW2(n) (1LL << (n))#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }///// This part below is only for debug, not used /////template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; returnos; }template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}";return os; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; returnos; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;///// END /////constexpr lint MOD = 1000000007;template <int mod>struct ModInt{using lint = long long;int val;constexpr ModInt() : val(0) {}constexpr void _setval(lint v) { v = (v % mod) + mod; val = v >= mod ? v - mod : v; }constexpr ModInt(lint v) { _setval(v); }constexpr ModInt operator+(const ModInt &x) const { return ModInt((lint)val + x.val); }constexpr ModInt operator-(const ModInt &x) const { return ModInt((lint)val - x.val); }constexpr ModInt operator*(const ModInt &x) const { return ModInt((lint)val * x.val); }constexpr ModInt operator/(const ModInt &x) const { return ModInt((lint)val * x.inv()); }constexpr ModInt operator-() const { return ModInt(-val); }constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt(a % mod + x.val); }friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt(a % mod - x.val); }friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt(a % mod * x.val); }friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt(a % mod * x.inv()); }constexpr bool operator==(const ModInt &x) { return val == x.val; }constexpr bool operator!=(const ModInt &x) { return val != x.val; }friend istream &operator>>(istream &is, ModInt &x) { lint t; is >> t; x = ModInt(t); return is; }friend ostream &operator<<(ostream &os, const ModInt &x) { os << x.val; return os; }constexpr lint power(lint n) const {lint ans = 1, tmp = this->val;while (n) {if (n & 1) ans = ans * tmp % mod;tmp = tmp * tmp % mod;n /= 2;}return ans;}constexpr lint inv() const { return this->power(mod - 2); }constexpr ModInt operator^(lint n) const { return ModInt(this->power(n)); }constexpr ModInt &operator^=(lint n) { return *this = *this ^ n; }inline ModInt fac() const {static vector<ModInt> facs;int l0 = facs.size();if (l0 > this->val) return facs[this->val];facs.resize(this->val + 1);for (int i = l0; i <= this->val; i++) facs[i] = (i == 0 ? ModInt(1) : facs[i - 1] * ModInt(i));return facs[this->val];}ModInt doublefac() const {lint k = (this->val + 1) / 2;if (this->val & 1) return ModInt(k * 2).fac() / ModInt(2).power(k) / ModInt(k).fac();else return ModInt(k).fac() * ModInt(2).power(k);}ModInt nCr(const ModInt &r) const {if (this->val < r.val) return ModInt(0);return this->fac() / ((*this - r).fac() * r.fac());}};using mint = ModInt<MOD>;using T = mint;void fast_integer_zeta(vector<T> &f){int N = f.size() - 1;vector<int> is_prime(N + 1, 1);for (int p = 2; p <= N; p++) if (is_prime[p]){for (int q = p * 2; q <= N; q += p) is_prime[q] = 0;for (int j = N / p * p; j > 0; j -= p) f[j / p] += f[j];}}void fast_integer_moebius(vector<T> &f){int N = f.size() - 1;vector<int> is_prime(N + 1, 1);for (int p = 2; p <= N; p++) if (is_prime[p]){for (int q = p * 2; q <= N; q += p) is_prime[q] = 0;for (int j = p; j <= N; j += p) f[j / p] -= f[j];}}int main(){lint H, W;cin >> H >> W;vector<mint> vh(max(H, W)), vw(max(H, W));REP(i, H) vh[i] = (H - i);REP(i, W) vw[i] = (W - i);fast_integer_zeta(vh);fast_integer_zeta(vw);REP(i, vh.size()) vh[i] = vh[i] * vw[i];fast_integer_moebius(vh);cout << vh[1] * 2 + H * (W - 1) + (H - 1) * W << endl;}