結果
問題 | No.1731 Product of Subsequence |
ユーザー | eQe |
提出日時 | 2021-11-06 22:56:07 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 758 ms / 2,000 ms |
コード長 | 2,587 bytes |
コンパイル時間 | 4,892 ms |
コンパイル使用メモリ | 276,352 KB |
実行使用メモリ | 13,940 KB |
最終ジャッジ日時 | 2023-08-07 23:32:28 |
合計ジャッジ時間 | 14,201 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 685 ms
13,332 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,504 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 40 ms
4,380 KB |
testcase_09 | AC | 3 ms
4,376 KB |
testcase_10 | AC | 748 ms
13,932 KB |
testcase_11 | AC | 627 ms
12,364 KB |
testcase_12 | AC | 3 ms
4,380 KB |
testcase_13 | AC | 4 ms
4,380 KB |
testcase_14 | AC | 559 ms
11,452 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 1 ms
4,380 KB |
testcase_18 | AC | 758 ms
13,940 KB |
testcase_19 | AC | 5 ms
4,376 KB |
testcase_20 | AC | 600 ms
11,840 KB |
testcase_21 | AC | 747 ms
13,936 KB |
testcase_22 | AC | 652 ms
13,932 KB |
testcase_23 | AC | 2 ms
4,380 KB |
testcase_24 | AC | 6 ms
4,376 KB |
testcase_25 | AC | 3 ms
4,380 KB |
testcase_26 | AC | 92 ms
5,116 KB |
testcase_27 | AC | 139 ms
5,752 KB |
testcase_28 | AC | 331 ms
8,280 KB |
testcase_29 | AC | 102 ms
5,228 KB |
testcase_30 | AC | 705 ms
13,888 KB |
testcase_31 | AC | 652 ms
13,820 KB |
testcase_32 | AC | 2 ms
4,376 KB |
testcase_33 | AC | 12 ms
4,376 KB |
testcase_34 | AC | 24 ms
4,376 KB |
ソースコード
#include <atcoder/all> using namespace atcoder; #include <bits/stdc++.h> #define all(a) (a.begin()),(a.end()) #define rall(a) (a.rbegin()),(a.rend()) using namespace std; using ll=long long; using ld=long double; using pll=pair<ll,ll>; template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;} template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;} template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; } template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;} template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; } template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} return os;} //istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; } //istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; } ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; } ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; } template<class... A> void pt() { std::cout << "\n"; } template<class... A> void pt_rest() { std::cout << "\n"; } template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); } template<class T, class... A> void pt(const T& first, const A&... rest) { std::cout << first; pt_rest(rest...); } static const ll INF=1e18+7; static const double PI=acos(-1); static const double EPS=1e-10; using v1d=vector<ll>; using v2d=vector<v1d>; using v3d=vector<v2d>; using v4d=vector<v3d>; v1d get_divisors(ll n){ vector<ll>res; for(ll i=1;i*i<=n;i++){ if(n%i)continue; res.push_back(i); if(n/i!=i)res.push_back(n/i); } sort(all(res)); return res; } int main(void) { cin.tie(nullptr); ios::sync_with_stdio(false); ll N,K;cin>>N>>K; v1d a(N);cin>>a; v1d div=get_divisors(K); ll M=div.size(); v2d cnt(N); for(ll i=0;i<N;i++)a[i]=gcd(a[i],K); ll C=0; map<ll,ll>ind; for(auto g:div)ind[g]=C++; using mint=modint1000000007; vector<vector<mint>>dp(N+1,vector<mint>(C)); dp[0][ind[1]]=1; for(ll i=0;i<N;i++){ for(auto j:div){ dp[i+1][ind[j]]+=dp[i][ind[j]]; dp[i+1][ind[gcd(K,a[i]*j)]]+=dp[i][ind[j]]; } } pt(dp[N][C-1]-(K==1)); }