結果
問題 | No.2075 GCD Subsequence |
ユーザー |
|
提出日時 | 2022-09-16 23:06:16 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,849 bytes |
コンパイル時間 | 4,119 ms |
コンパイル使用メモリ | 242,868 KB |
実行使用メモリ | 308,660 KB |
最終ジャッジ日時 | 2024-12-21 22:38:37 |
合計ジャッジ時間 | 105,267 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 1 WA * 7 TLE * 20 |
コンパイルメッセージ
main.cpp: In function 'void in(T& ...)': main.cpp:30:55: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 30 | template<class... T> void in(T&... a){ (cin >> ... >> a); } | ^ main.cpp: In function 'void out(const T&, const Ts& ...)': main.cpp:32:112: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 32 | template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } | ^ main.cpp: In function 'void solve()': main.cpp:81:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 81 | for(auto [k, x] : mp){ | ^
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;#define rep(i,n) for(int i = 0; i < (int)(n); ++i)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)#define ALL(a) a.begin(), a.end()#define Sort(a) sort(a.begin(), a.end())#define RSort(a) sort(a.rbegin(), a.rend())typedef long long int ll;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef pair<long long, long long> P;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double PI = acos(-1);template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; i++){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }template <typename T>struct PrimeFact{vector<T> spf;PrimeFact(T N){ init(N); }void init(T N){spf.assign(N + 1, 0);for(T i = 0; i <= N; i++) spf[i] = i;for(T i = 2; i * i <= N; i++) {if(spf[i] == i) {for(T j = i * i; j <= N; j += i){if(spf[j] == j){spf[j] = i;}}}}}map<T, T> get(T n){map<T, T> m;while(n != 1){if(m.count(spf[n]) == 0){m[spf[n]] = 1;}else{m[spf[n]]++;}n /= spf[n];}return m;}};ll n;vll a;void input(){in(n);vin(a, n);}void solve(){vll dp(1000001);PrimeFact<ll> pf(1000000);vector<set<ll>> p(1000001);rep(i, n){map<ll, ll> mp = pf.get(a[i]);for(auto [k, x] : mp){for(auto y : p[k]){dp[a[i]] += dp[y];}p[k].insert(a[i]);}dp[a[i]]++;dp[a[i]] %= MOD;}ll ans = 0;rep(i, 1000001){ans += dp[i];dp[i] %= MOD;}out(ans);}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);input();solve();}