結果

問題 No.886 Direct
ユーザー ei1333333ei1333333
提出日時 2019-09-13 22:27:01
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 571 ms / 4,000 ms
コード長 5,089 bytes
コンパイル時間 2,533 ms
コンパイル使用メモリ 212,276 KB
実行使用メモリ 39,760 KB
最終ジャッジ日時 2024-07-04 10:01:26
合計ジャッジ時間 14,843 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 258 ms
27,856 KB
testcase_01 AC 239 ms
27,856 KB
testcase_02 AC 241 ms
27,980 KB
testcase_03 AC 240 ms
27,856 KB
testcase_04 AC 239 ms
27,984 KB
testcase_05 AC 242 ms
27,984 KB
testcase_06 AC 242 ms
27,852 KB
testcase_07 AC 241 ms
27,988 KB
testcase_08 AC 240 ms
27,860 KB
testcase_09 AC 241 ms
27,856 KB
testcase_10 AC 238 ms
27,852 KB
testcase_11 AC 237 ms
27,980 KB
testcase_12 AC 240 ms
27,856 KB
testcase_13 AC 241 ms
27,860 KB
testcase_14 AC 243 ms
27,856 KB
testcase_15 AC 242 ms
27,892 KB
testcase_16 AC 251 ms
27,856 KB
testcase_17 AC 258 ms
27,856 KB
testcase_18 AC 249 ms
27,852 KB
testcase_19 AC 245 ms
27,988 KB
testcase_20 AC 251 ms
27,984 KB
testcase_21 AC 241 ms
27,860 KB
testcase_22 AC 244 ms
27,984 KB
testcase_23 AC 303 ms
33,488 KB
testcase_24 AC 279 ms
31,824 KB
testcase_25 AC 247 ms
29,400 KB
testcase_26 AC 307 ms
32,960 KB
testcase_27 AC 332 ms
34,640 KB
testcase_28 AC 402 ms
38,480 KB
testcase_29 AC 425 ms
39,636 KB
testcase_30 AC 259 ms
27,856 KB
testcase_31 AC 447 ms
39,632 KB
testcase_32 AC 551 ms
39,760 KB
testcase_33 AC 571 ms
39,760 KB
testcase_34 AC 483 ms
39,636 KB
testcase_35 AC 451 ms
39,636 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = (int) (1e9 + 7);

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }
};

using modint = ModInt< mod >;


vector< bool > isprime;
vector< int > primes;

void sieve(int n) {
  if((int) isprime.size() >= n + 1) return;
  isprime.assign(n + 1, true);
  isprime[0] = isprime[1] = false;
  int sqrtn = (int) (sqrt(n * 1.) + .5);
  for(int i = 2; i <= sqrtn; i++)
    if(isprime[i]) {
      for(int j = i * i; j <= n; j += i)
        isprime[j] = false;
    }
  primes.clear();
  for(int i = 2; i <= n; i++)
    if(isprime[i])
      primes.push_back(i);
}


vector< int > mobiusMu;

void calcMobiusMu() {
  int n = (int) isprime.size() - 1;
  mobiusMu.assign(n + 1, 1);
  for(int i = 2; i <= n; i++)
    if(isprime[i]) {
      if((int64) i * i <= n) {
        for(int j = i * i; j <= n; j += i * i)
          mobiusMu[j] = 0;
      }
      for(int j = i; j <= n; j += i)
        mobiusMu[j] *= -1;
    }
}

// https://oeis.org/A115009

int main() {
  sieve(3000000);
  calcMobiusMu();

  int64 H, W;
  cin >> H >> W;
  --H, --W;


  const int MAX_N = 3000000;
  vector< modint > dp(MAX_N);
  for(int i = 1; i <= W; i++) {
    dp[i] = W - i + 1;
  }
  for(int i = 1; i <= MAX_N; i++) {
    for(int j = i + i; j <= MAX_N; j += i) {
      dp[i] += dp[j];
    }
  }
  vector< modint > ans(H + 1);
  for(int i = 1; i <= H; i++) {
    dp[i] *= mobiusMu[i];
    for(int j = i; j <= H; j += i) {
      ans[j] += dp[i];
    }
  }
  modint ret = 0;
  for(int i = 1; i <= H; i++) {
    ret += ans[i] * (H - i + 1);
  }
  cout << ret * 2 + 2 * H * W + H + W << endl;
}
0