結果
問題 | No.886 Direct |
ユーザー | paruki |
提出日時 | 2019-09-17 18:50:00 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,164 ms / 4,000 ms |
コード長 | 3,416 bytes |
コンパイル時間 | 1,801 ms |
コンパイル使用メモリ | 172,060 KB |
実行使用メモリ | 26,624 KB |
最終ジャッジ日時 | 2024-07-07 13:30:49 |
合計ジャッジ時間 | 22,072 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 7 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 11 ms
5,376 KB |
testcase_18 | AC | 11 ms
5,376 KB |
testcase_19 | AC | 10 ms
5,376 KB |
testcase_20 | AC | 7 ms
5,376 KB |
testcase_21 | AC | 3 ms
5,376 KB |
testcase_22 | AC | 13 ms
5,376 KB |
testcase_23 | AC | 978 ms
14,336 KB |
testcase_24 | AC | 675 ms
11,008 KB |
testcase_25 | AC | 246 ms
6,272 KB |
testcase_26 | AC | 859 ms
13,056 KB |
testcase_27 | AC | 1,190 ms
16,484 KB |
testcase_28 | AC | 1,936 ms
24,248 KB |
testcase_29 | AC | 2,118 ms
26,556 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 2,140 ms
26,624 KB |
testcase_32 | AC | 2,129 ms
26,624 KB |
testcase_33 | AC | 2,151 ms
26,624 KB |
testcase_34 | AC | 2,164 ms
26,624 KB |
testcase_35 | AC | 2,150 ms
26,624 KB |
ソースコード
#define _USE_MATH_DEFINES #include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define MT make_tuple #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)<<endl #define smax(x,y) (x)=max((x),(y)) #define smin(x,y) (x)=min((x),(y)) #define MEM(x,y) memset((x),(y),sizeof (x)) #define sz(x) (int)(x).size() #define RT return using ll = long long; using pii = pair<int, int>; using vi = vector<int>; using vll = vector<ll>; template<int MOD> class ModInt { public: ModInt() :value(0) {} ModInt(long long val) :value((int)(val<0 ? MOD + val % MOD : val % MOD)) { } ModInt& operator+=(ModInt that) { value = value + that.value; if (value >= MOD)value -= MOD; return *this; } ModInt& operator-=(ModInt that) { value -= that.value; if (value<0)value += MOD; return *this; } ModInt& operator*=(ModInt that) { value = (int)((long long)value * that.value % MOD); return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt pow(long long k) const { ModInt n = *this, res = 1; while (k) { if (k & 1)res *= n; n *= n; k >>= 1; } return res; } ModInt inverse() const { long long a = value, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return ModInt(u); } int toi() const { return value; } private: int value; }; typedef ModInt<1000000007> mint; ostream& operator<<(ostream& os, const mint& x) { os << x.toi(); return os; } vector<int> factorizer(int n) { vector<int> res(n + 1, 1); for (int i = 2; i <= n; ++i)if (res[i] == 1) { for (int j = i; j <= n; j += i) { res[j] = i; } } return res; } void solve() { int H, W; cin >> H >> W; auto f = factorizer(H); vector<int> used(H + 1); mint ans = (H - 1ll)*W + (W - 1ll)*H; for (int y = 1; y <= H; ++y) { vector<int> ps; int val = y; while (val != 1) { if (used[f[val]] != y) { used[f[val]] = y; ps.push_back(f[val]); } val /= f[val]; } mint sum, tum; int n = sz(ps); rep(S, 1 << n) { int cnt = 0, base = 1; rep(i, n)if (S >> i & 1) { cnt++; base *= ps[i]; } int m = W / base; sum += mint(cnt & 1 ? -1 : 1) * m; tum += mint(cnt & 1 ? -1 : 1)*(base + base*m) / 2 * m; } ans += (sum*W - tum) * (H - y) * 2; } cout << ans << endl; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); solve(); return 0; }