結果
問題 | No.1532 Different Products |
ユーザー | 👑 tatyam |
提出日時 | 2021-05-17 15:03:28 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,611 bytes |
コンパイル時間 | 3,425 ms |
コンパイル使用メモリ | 233,760 KB |
実行使用メモリ | 36,260 KB |
最終ジャッジ日時 | 2024-04-27 03:48:12 |
合計ジャッジ時間 | 71,212 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
36,064 KB |
testcase_01 | AC | 759 ms
36,036 KB |
testcase_02 | AC | 90 ms
35,964 KB |
testcase_03 | AC | 39 ms
35,948 KB |
testcase_04 | AC | 55 ms
35,948 KB |
testcase_05 | AC | 22 ms
36,052 KB |
testcase_06 | AC | 134 ms
36,064 KB |
testcase_07 | AC | 222 ms
35,972 KB |
testcase_08 | AC | 255 ms
36,080 KB |
testcase_09 | AC | 395 ms
35,992 KB |
testcase_10 | AC | 667 ms
36,240 KB |
testcase_11 | AC | 615 ms
36,148 KB |
testcase_12 | AC | 1,070 ms
36,056 KB |
testcase_13 | AC | 607 ms
36,060 KB |
testcase_14 | AC | 1,501 ms
36,052 KB |
testcase_15 | AC | 235 ms
36,024 KB |
testcase_16 | AC | 1,029 ms
36,088 KB |
testcase_17 | AC | 588 ms
36,188 KB |
testcase_18 | AC | 449 ms
36,260 KB |
testcase_19 | AC | 916 ms
36,120 KB |
testcase_20 | AC | 1,331 ms
36,032 KB |
testcase_21 | AC | 1,146 ms
36,036 KB |
testcase_22 | AC | 722 ms
36,168 KB |
testcase_23 | AC | 487 ms
36,120 KB |
testcase_24 | AC | 1,289 ms
36,052 KB |
testcase_25 | AC | 1,131 ms
36,172 KB |
testcase_26 | AC | 521 ms
35,956 KB |
testcase_27 | AC | 1,372 ms
36,048 KB |
testcase_28 | AC | 1,033 ms
36,132 KB |
testcase_29 | AC | 1,368 ms
36,124 KB |
testcase_30 | AC | 1,497 ms
36,104 KB |
testcase_31 | AC | 1,431 ms
36,192 KB |
testcase_32 | AC | 1,423 ms
36,116 KB |
testcase_33 | AC | 1,378 ms
35,992 KB |
testcase_34 | AC | 1,380 ms
36,056 KB |
testcase_35 | AC | 1,407 ms
36,120 KB |
testcase_36 | AC | 1,451 ms
36,028 KB |
testcase_37 | AC | 1,334 ms
36,076 KB |
testcase_38 | AC | 1,381 ms
36,088 KB |
testcase_39 | AC | 1,338 ms
36,116 KB |
testcase_40 | AC | 1,284 ms
36,060 KB |
testcase_41 | AC | 1,416 ms
36,056 KB |
testcase_42 | AC | 1,447 ms
36,088 KB |
testcase_43 | AC | 1,404 ms
36,028 KB |
testcase_44 | AC | 1,435 ms
36,160 KB |
testcase_45 | AC | 1,413 ms
36,096 KB |
testcase_46 | AC | 1,422 ms
36,192 KB |
testcase_47 | AC | 1,479 ms
36,032 KB |
testcase_48 | AC | 1,463 ms
36,196 KB |
testcase_49 | AC | 1,483 ms
36,164 KB |
testcase_50 | AC | 1,472 ms
36,176 KB |
testcase_51 | AC | 1,467 ms
36,040 KB |
testcase_52 | AC | 1,510 ms
36,056 KB |
testcase_53 | AC | 1,497 ms
36,060 KB |
testcase_54 | AC | 1,523 ms
36,060 KB |
testcase_55 | AC | 1,493 ms
36,176 KB |
testcase_56 | AC | 1,458 ms
36,036 KB |
testcase_57 | AC | 1,494 ms
36,032 KB |
testcase_58 | AC | 1,461 ms
36,056 KB |
testcase_59 | AC | 1,505 ms
36,084 KB |
testcase_60 | AC | 1,449 ms
36,116 KB |
testcase_61 | AC | 2 ms
6,944 KB |
testcase_62 | AC | 13 ms
35,988 KB |
testcase_63 | WA | - |
ソースコード
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using u32 = uint32_t; using u64 = uint64_t; vector<bool> sieve_of_atkin(int N){ vector<bool> isprime(N + 1); const int sqrtN = sqrt(N); int n; for(int z = 1; z <= 5; z += 4) for(int y = z; y <= sqrtN; y += 6){ for(int x = 1; x <= sqrtN && (n = 4*x*x+y*y) <= N; ++x) isprime[n] = !isprime[n]; for(int x = y+1; x <= sqrtN && (n = 3*x*x-y*y) <= N; x += 2) isprime[n] = !isprime[n]; } for(int z = 2; z <= 4; z += 2) for(int y = z; y <= sqrtN; y += 6){ for(int x = 1; x <= sqrtN && (n = 3*x*x+y*y) <= N; x += 2) isprime[n] = !isprime[n]; for(int x = y+1; x <= sqrtN && (n = 3*x*x-y*y) <= N; x += 2) isprime[n] = !isprime[n]; } for(int y = 3; y <= sqrtN; y += 6) for(int z = 1; z <= 2; ++z){ for(int x = z; x <= sqrtN && (n = 4*x*x+y*y) <= N; x += 3) isprime[n] = !isprime[n]; } for(int n = 5; n <= sqrtN; ++n) if(isprime[n]) for(int k = n*n; k <= N; k+=n*n) isprime[k] = false; isprime[2] = isprime[3] = true; return isprime; } vector<u32> primes(int N){ auto isprime = sieve_of_atkin(N); vector<u32> ans; for(int i = 2; i <= N; i++) if(isprime[i]) ans.push_back(i); return ans; } int main(){ constexpr u32 MAX = 1 << 22; u32 N; u64 K; cin >> N >> K; if(K == 1) return puts("1") & 0; const vector<u32> P = primes(N); vector<u32> lg(N + 1); for(u32 i : P) lg[i] = round(logl(i) / logl(K) * MAX); for(u32 p : P) for(u32 i = 2; i * p <= N; i++) lg[i * p] = lg[i] + lg[p]; vector<u64> dp(MAX + 1); dp[0] = 2; for(u32 i = 2; i <= N; i++){ const u32 x = lg[i]; for(u32 i = MAX; i >= x; i--) dp[i] += dp[i - x]; } dp.resize(MAX - 7); u64 ans = accumulate(dp.begin(), dp.end(), -1LL); auto solve = [N](u64 x) -> u32 { vector<pair<u64, u32>> dp = {{1, 2}}; for(u32 j = 2; j <= N; j++) if(x % j == 0){ auto update = [x, j](pair<u64, u32>& a){ a.first *= j; if(a.first < x && x % a.first) a.first = 0; }; vector<pair<u64, u32>> dp2; u32 p = 0, q = 0; while(q < dp.size()){ if(dp[q].first == 0){ q++; continue; } if(p < dp.size()){ if(p == q || dp[p].first < dp[q].first){ dp2.push_back(dp[p]); update(dp[p]); p++; } else if(dp[p].first == dp[q].first){ dp2.emplace_back(dp[p].first, dp[p].second + dp[q].second); update(dp[p]); p++; q++; } else{ dp2.push_back(dp[q]); q++; } continue; } if(dp[q].first > x) break; dp2.push_back(dp[q]); q++; } swap(dp, dp2); } if(dp.back().first != x) return 0; return dp.back().second; }; for(u64 i = max<int64_t>(2, K - 1e6); i <= K; i++){ u64 x = i; u32 y = 0; for(u32 p : P) while(x % p == 0){ x /= p; y += lg[p]; } if(y >= dp.size()) ans += solve(i); } cout << ans << endl; }