結果

問題 No.886 Direct
ユーザー hitonanodehitonanode
提出日時 2019-09-28 16:47:31
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 626 ms / 4,000 ms
コード長 4,074 bytes
コンパイル時間 1,935 ms
コンパイル使用メモリ 171,468 KB
実行使用メモリ 61,888 KB
最終ジャッジ日時 2024-10-02 11:57:07
合計ジャッジ時間 8,940 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 3 ms
6,816 KB
testcase_04 AC 1 ms
6,820 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,820 KB
testcase_07 AC 2 ms
6,820 KB
testcase_08 AC 2 ms
6,816 KB
testcase_09 AC 2 ms
6,816 KB
testcase_10 AC 2 ms
6,816 KB
testcase_11 AC 2 ms
6,820 KB
testcase_12 AC 2 ms
6,816 KB
testcase_13 AC 2 ms
6,820 KB
testcase_14 AC 2 ms
6,816 KB
testcase_15 AC 2 ms
6,820 KB
testcase_16 AC 2 ms
6,820 KB
testcase_17 AC 3 ms
6,820 KB
testcase_18 AC 4 ms
6,816 KB
testcase_19 AC 3 ms
6,816 KB
testcase_20 AC 2 ms
6,820 KB
testcase_21 AC 4 ms
6,820 KB
testcase_22 AC 3 ms
6,816 KB
testcase_23 AC 165 ms
30,732 KB
testcase_24 AC 209 ms
33,392 KB
testcase_25 AC 102 ms
21,796 KB
testcase_26 AC 157 ms
27,728 KB
testcase_27 AC 595 ms
57,440 KB
testcase_28 AC 559 ms
55,808 KB
testcase_29 AC 626 ms
61,860 KB
testcase_30 AC 589 ms
61,888 KB
testcase_31 AC 608 ms
61,792 KB
testcase_32 AC 563 ms
61,740 KB
testcase_33 AC 578 ms
61,812 KB
testcase_34 AC 571 ms
61,836 KB
testcase_35 AC 598 ms
61,788 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 << "}"; return os; }
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 << ")"; return os; }
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;

void fast_integer_zeta(vector<lint> &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]) %= MOD;
    }
}

void fast_integer_moebius(vector<lint> &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] += MOD - f[j]) %= MOD;
    }
}

int main()
{
    lint H, W;
    cin >> H >> W;
    vector<lint> 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] % MOD;
    fast_integer_moebius(vh);
    cout << (vh[1] * 2 + H * (W - 1) + (H - 1) * W) % MOD << endl;
}
0