結果
問題 | No.917 Make One With GCD |
ユーザー | Enjapma_kyopro |
提出日時 | 2019-11-08 03:25:10 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 73 ms / 2,000 ms |
コード長 | 3,098 bytes |
コンパイル時間 | 1,688 ms |
コンパイル使用メモリ | 167,348 KB |
実行使用メモリ | 21,368 KB |
最終ジャッジ日時 | 2024-06-24 11:10:55 |
合計ジャッジ時間 | 2,836 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 15 ms
18,920 KB |
testcase_01 | AC | 7 ms
18,468 KB |
testcase_02 | AC | 6 ms
17,896 KB |
testcase_03 | AC | 8 ms
19,756 KB |
testcase_04 | AC | 8 ms
19,052 KB |
testcase_05 | AC | 7 ms
18,848 KB |
testcase_06 | AC | 73 ms
19,708 KB |
testcase_07 | AC | 32 ms
18,476 KB |
testcase_08 | AC | 9 ms
17,396 KB |
testcase_09 | AC | 14 ms
20,028 KB |
testcase_10 | AC | 15 ms
21,368 KB |
testcase_11 | AC | 13 ms
18,280 KB |
testcase_12 | AC | 17 ms
18,292 KB |
testcase_13 | AC | 12 ms
18,196 KB |
testcase_14 | AC | 14 ms
19,836 KB |
testcase_15 | AC | 14 ms
18,432 KB |
testcase_16 | AC | 13 ms
19,812 KB |
testcase_17 | AC | 7 ms
18,096 KB |
testcase_18 | AC | 9 ms
19,704 KB |
testcase_19 | AC | 7 ms
18,636 KB |
testcase_20 | AC | 8 ms
19,816 KB |
testcase_21 | AC | 10 ms
18,340 KB |
testcase_22 | AC | 8 ms
18,424 KB |
testcase_23 | AC | 10 ms
18,608 KB |
testcase_24 | AC | 8 ms
18,680 KB |
testcase_25 | AC | 11 ms
21,188 KB |
testcase_26 | AC | 7 ms
19,116 KB |
testcase_27 | AC | 6 ms
17,260 KB |
testcase_28 | AC | 7 ms
17,344 KB |
testcase_29 | AC | 7 ms
18,500 KB |
testcase_30 | AC | 7 ms
17,440 KB |
testcase_31 | AC | 7 ms
18,460 KB |
testcase_32 | AC | 6 ms
18,240 KB |
testcase_33 | AC | 8 ms
19,140 KB |
testcase_34 | AC | 7 ms
17,408 KB |
testcase_35 | AC | 7 ms
18,220 KB |
ソースコード
#include <bits/stdc++.h> #include <unistd.h> using namespace std; typedef long long ll; typedef pair<ll,ll> P; long long int INF = 3e18; const ll fact_table = 5000000; double Pi = 3.1415926535897932384626; //vector<ll> G[550010]; vector<P> tree[500010]; priority_queue <ll> pql; priority_queue <P> pqp; //big priority queue priority_queue <ll,vector<ll>,greater<ll> > pqls; priority_queue <P,vector<P>,greater<P> > pqps; //small priority queue //top pop int dx[8]={1,0,-1,0,1,1,-1,-1}; int dy[8]={0,1,0,-1,1,-1,-1,1}; char dir[] = "DRUL"; //ll bit[500005]; //↓,→,↑,← #define p(x) cout<<x<<"\n"; #define el cout<<endl; #define pe(x) cout<<(x)<<" "; #define ps(x) cout<<fixed<<setprecision(25)<<x<<endl; #define pu(x) cout<<(x); #define pb push_back #define lb lower_bound #define ub upper_bound #define CLEAR(a) a = decltype(a)(); ll mod = 998244353; //ll mod = 1000000007; ll rui(ll number1,ll number2){ if(number2 == 0){ return 1; }else{ ll number3 = rui(number1,number2 / 2); number3 *= number3; number3 %= mod; if(number2%2==1){ number3 *= number1; number3 %= mod; } return number3; } } ll gcd(ll number1,ll number2){ if(number1 > number2){ swap(number1,number2); } if(number1 == 0 || number1 == number2){ return number2; }else{ return gcd(number2 % number1,number1); } } void YES(bool condition){ if(condition){ p("YES"); }else{ p("NO"); } return; } void Yes(bool condition){ if(condition){ p("Yes"); }else{ p("No"); } return; } /* ll fact[fact_table + 5],rfact[fact_table + 5]; void c3_init(){ fact[0] = rfact[0] = 1; for(ll i=1; i<=fact_table; i++){ fact[i] = (fact[i-1]*i) % mod; } rfact[fact_table] = rui(fact[fact_table],mod - 2); for(ll i=fact_table; i>=1; i--){ rfact[i-1] = rfact[i] * i; rfact[i-1] %= mod; } return;} ll c3(ll n,ll r){ return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;} */ ll n,m,num,sum,a,b,c,d,e,g,h,w,i,j,q,r,l; ll k,idx,ans; ll x[500005],y[500005],z[500005]; ll dp[55][3000]; vector <ll> v; ll find_idx(ll num){ return lb(v.begin(), v.end(), num) - v.begin(); } void solve(ll idx){ v.clear(); for(int i=1;i*i<=x[idx];i++){ if(x[idx] % i == 0){ v.pb(i); if(i * i != x[idx]){ v.pb(x[idx] / i); } } } sort(v.begin(), v.end()); m = v.size(); for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ dp[i][j] = 0; } } dp[idx][m - 1] = 1; for(int i=idx + 1;i < n;i++){ for(int j=0;j<m;j++){ dp[i][j] += dp[i-1][j]; ll value = find_idx(gcd(x[i], v[j])); dp[i][value] += dp[i-1][j]; } } ans += dp[n - 1][0]; return; } int main(){ cin >> n; for(int i=0;i<n;i++){ cin >> x[i]; } for(int i=0;i<n;i++){ solve(i); } p(ans); return 0; }