結果
問題 | No.1973 Divisor Sequence |
ユーザー | 👑 AngrySadEight |
提出日時 | 2023-03-02 09:47:36 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 680 ms / 2,000 ms |
コード長 | 3,202 bytes |
コンパイル時間 | 5,910 ms |
コンパイル使用メモリ | 310,028 KB |
実行使用メモリ | 179,136 KB |
最終ジャッジ日時 | 2024-09-17 06:23:48 |
合計ジャッジ時間 | 9,402 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 157 ms
29,916 KB |
testcase_03 | AC | 11 ms
6,940 KB |
testcase_04 | AC | 93 ms
18,868 KB |
testcase_05 | AC | 29 ms
16,548 KB |
testcase_06 | AC | 101 ms
25,260 KB |
testcase_07 | AC | 23 ms
7,004 KB |
testcase_08 | AC | 57 ms
14,928 KB |
testcase_09 | AC | 82 ms
16,880 KB |
testcase_10 | AC | 106 ms
20,308 KB |
testcase_11 | AC | 19 ms
6,940 KB |
testcase_12 | AC | 83 ms
21,008 KB |
testcase_13 | AC | 25 ms
8,192 KB |
testcase_14 | AC | 66 ms
17,664 KB |
testcase_15 | AC | 134 ms
22,072 KB |
testcase_16 | AC | 134 ms
25,976 KB |
testcase_17 | AC | 88 ms
17,488 KB |
testcase_18 | AC | 15 ms
6,944 KB |
testcase_19 | AC | 117 ms
21,892 KB |
testcase_20 | AC | 25 ms
6,940 KB |
testcase_21 | AC | 123 ms
30,388 KB |
testcase_22 | AC | 109 ms
22,020 KB |
testcase_23 | AC | 680 ms
179,136 KB |
testcase_24 | AC | 304 ms
46,224 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } int main(){ ll N, M; cin >> N >> M; map<ll, ll> mp; ll M_cpy = M; for (ll i = 2; i * i <= M; i++){ while(true){ if (M_cpy % i != 0){ break; } mp[i]++; M_cpy /= i; } } if (M_cpy != 1) mp[M_cpy]++; //debug(mp); ll ans = 1; for (auto itr = mp.begin(); itr != mp.end(); itr++){ ll count = itr->second; vvl dp(N, vl(count + 1)); for (ll i = 0; i <= count; i++){ dp[0][i] = 1; } for (ll i = 1; i < N; i++){ for (ll j = 0; j <= count; j++){ for (ll k = 0; k + j <= count; k++){ dp[i][k] = (dp[i][k] + dp[i - 1][j]) % mod1; } } } ll sum = 0; for (ll i = 0; i <= count; i++){ sum = (sum + dp[N - 1][i]) % mod1; } ans = (ans * sum) % mod1; } cout << ans << endl; }