結果
問題 | No.2318 Phys Bone Maker |
ユーザー | hliuser1 |
提出日時 | 2023-06-09 05:57:52 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 780 ms / 3,000 ms |
コード長 | 2,873 bytes |
コンパイル時間 | 6,276 ms |
コンパイル使用メモリ | 265,340 KB |
実行使用メモリ | 12,116 KB |
最終ジャッジ日時 | 2023-08-30 04:32:40 |
合計ジャッジ時間 | 11,503 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 10 ms
7,940 KB |
testcase_01 | AC | 11 ms
7,992 KB |
testcase_02 | AC | 780 ms
12,024 KB |
testcase_03 | AC | 20 ms
7,952 KB |
testcase_04 | AC | 31 ms
7,952 KB |
testcase_05 | AC | 24 ms
7,940 KB |
testcase_06 | AC | 26 ms
7,924 KB |
testcase_07 | AC | 13 ms
8,180 KB |
testcase_08 | AC | 24 ms
7,892 KB |
testcase_09 | AC | 28 ms
7,868 KB |
testcase_10 | AC | 38 ms
7,876 KB |
testcase_11 | AC | 41 ms
7,876 KB |
testcase_12 | AC | 58 ms
8,016 KB |
testcase_13 | AC | 31 ms
8,104 KB |
testcase_14 | AC | 32 ms
7,872 KB |
testcase_15 | AC | 32 ms
8,160 KB |
testcase_16 | AC | 25 ms
7,864 KB |
testcase_17 | AC | 31 ms
7,884 KB |
testcase_18 | AC | 61 ms
8,028 KB |
testcase_19 | AC | 22 ms
7,876 KB |
testcase_20 | AC | 29 ms
7,948 KB |
testcase_21 | AC | 26 ms
7,960 KB |
testcase_22 | AC | 22 ms
8,088 KB |
testcase_23 | AC | 23 ms
7,872 KB |
testcase_24 | AC | 35 ms
7,928 KB |
testcase_25 | AC | 30 ms
8,152 KB |
testcase_26 | AC | 26 ms
7,900 KB |
testcase_27 | AC | 28 ms
7,860 KB |
testcase_28 | AC | 24 ms
7,932 KB |
testcase_29 | AC | 22 ms
8,004 KB |
testcase_30 | AC | 19 ms
7,872 KB |
testcase_31 | AC | 45 ms
7,880 KB |
testcase_32 | AC | 29 ms
7,932 KB |
testcase_33 | AC | 11 ms
8,080 KB |
testcase_34 | AC | 26 ms
8,080 KB |
testcase_35 | AC | 90 ms
9,656 KB |
testcase_36 | AC | 356 ms
11,128 KB |
testcase_37 | AC | 354 ms
10,644 KB |
testcase_38 | AC | 364 ms
10,564 KB |
testcase_39 | AC | 550 ms
11,724 KB |
testcase_40 | AC | 554 ms
11,572 KB |
testcase_41 | AC | 634 ms
12,116 KB |
testcase_42 | AC | 648 ms
11,636 KB |
testcase_43 | AC | 32 ms
7,916 KB |
testcase_44 | AC | 96 ms
8,508 KB |
testcase_45 | AC | 89 ms
8,560 KB |
testcase_46 | AC | 645 ms
11,220 KB |
testcase_47 | AC | 32 ms
7,884 KB |
コンパイルメッセージ
メンバ関数 ‘bool sieve::operator()(int)’ 内, inlined from ‘int main()’ at main.cpp:80:19: main.cpp:44:49: 警告: iteration 999999 invokes undefined behavior [-Waggressive-loop-optimizations] 44 | inline bool operator()(int n) { return spf[n] == n; } | ~~~~~^ main.cpp: 関数 ‘int main()’ 内: main.cpp:79:29: 備考: within this loop 79 | for (int z{-1}, i{2}; i <= sieve::N; ++i) | ~~^~~~~~~~~~~
ソースコード
// https://yukicoder.me/problems/no/2318 // use the trick from Hossam & trainees. // compute list of all primes up to sqrt(N) // use repeated division to find any remaining "big" primes #include <bits/stdc++.h> #pragma GCC optimize("O3") #pragma GCC target("sse4") using namespace std; using ll = long long; static constexpr ll Q = 998244353; template <typename K, typename V> using Map = map<K, V>; template <typename Int> vector<Int> factorize(Int n, Int i=1) { vector<Int> f; f.reserve( sqrt(n) ); for (; i*i < n; ++i) if (n % i == 0) f.push_back(i); i -= (i - (n / i) == 1); for (; i >= 1; i--) if (n % i == 0) f.push_back(n/i); return f; } struct sieve { static constexpr size_t N = 1000001; int spf[N] = {}; sieve() { spf[0] = spf[1] = -1; for (int i = 3; i <= N; i += 2) spf[i] = i; for (int i = 2; i <= N; i += 2) spf[i] = 2; // avoid lots of % later for (int i = 3; i*i <= N; i += 2) { if (spf[i] != i) continue; for (int j = i*i; j <= N; j += i) if (spf[j] == j) spf[j] = i; } } inline bool operator()(int n) { return spf[n] == n; } template <class Int> inline Map<Int, int> factors(Int n) { Map<Int, int> mp; while (n != 1) { int p = spf[n]; while (n % p == 0) { ++mp[p]; n /= p; } } return mp; } } prime; ll primes[78498]; // list of all primes < 1e6 Map<ll, int> prime_factorize(ll x) { if (x < sieve::N) return prime.factors(x); Map<ll, int> mp; ll y = x; for (int p : primes) { while (y % p == 0) { y /= p; ++mp[p]; } if (y == 1) break; } if (y != 1) mp[y] = 1; return mp; } signed main() { for (int z{-1}, i{2}; i <= sieve::N; ++i) if ( prime(i) ) primes[++z] = i; ll N; cin >> N; unordered_map<ll, ll> dp; // dp[x] = sum(dp[y]*Z forall y such that x%y==0) where Z is # of z s.t. lcm(y,z) = x dp[1] = 1; auto facts = factorize(N); int X = facts.size(); vector<Map<ll,int>> prime_facs(X); for (int i = 0; i < X; ++i) { ll f = facts[i]; prime_facs[i] = prime_factorize(f); } for (int i = 1; i < X; ++i) { ll x = facts[i]; auto& pfx = prime_facs[i]; for (int j = 0; j < i; ++j) { ll y = facts[j]; if (x % y != 0) continue; ll ways = dp[y]; // # of z where lcm(y,z) = x auto& pfy = prime_facs[j]; for (auto [p, cnt] : pfx) if (pfy[p] == cnt) ways = ways * (cnt+1) % Q; dp[x] = (dp[x]+ways) % Q; } } cout << dp[N] << '\n'; }