結果

問題 No.2075 GCD Subsequence
ユーザー noya2noya2
提出日時 2022-09-16 23:01:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 320 ms / 4,000 ms
コード長 4,715 bytes
コンパイル時間 4,782 ms
コンパイル使用メモリ 275,564 KB
実行使用メモリ 15,596 KB
最終ジャッジ日時 2023-08-23 16:29:39
合計ジャッジ時間 11,304 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
14,528 KB
testcase_01 AC 32 ms
14,604 KB
testcase_02 AC 33 ms
14,592 KB
testcase_03 AC 33 ms
14,532 KB
testcase_04 AC 33 ms
14,492 KB
testcase_05 AC 32 ms
14,548 KB
testcase_06 AC 34 ms
14,624 KB
testcase_07 AC 33 ms
14,616 KB
testcase_08 AC 93 ms
15,144 KB
testcase_09 AC 130 ms
15,352 KB
testcase_10 AC 94 ms
15,072 KB
testcase_11 AC 114 ms
15,416 KB
testcase_12 AC 104 ms
15,024 KB
testcase_13 AC 82 ms
15,060 KB
testcase_14 AC 112 ms
15,344 KB
testcase_15 AC 86 ms
15,132 KB
testcase_16 AC 91 ms
15,076 KB
testcase_17 AC 128 ms
15,328 KB
testcase_18 AC 311 ms
15,352 KB
testcase_19 AC 308 ms
15,404 KB
testcase_20 AC 307 ms
15,412 KB
testcase_21 AC 310 ms
15,340 KB
testcase_22 AC 310 ms
15,420 KB
testcase_23 AC 313 ms
15,328 KB
testcase_24 AC 307 ms
15,396 KB
testcase_25 AC 308 ms
15,596 KB
testcase_26 AC 312 ms
15,344 KB
testcase_27 AC 312 ms
15,432 KB
testcase_28 AC 320 ms
15,388 KB
testcase_29 AC 32 ms
14,596 KB
testcase_30 AC 32 ms
14,548 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#line 1 "c.cpp"
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using ppi = pair<P,int>;
using pip = pair<int,P>;
const int INF = 1001001007;
const long long mod1 = 1000000007LL;
const long long mod2 = 998244353LL;
const ll inf = 2e18;
const ld pi = 3.14159265358979323;
const ld eps = 1e-7;
template<typename T>void o(T a);
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}
void revs(string &s) {reverse(s.begin(),s.end());}
template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T>T cel(T a,T b){return (a+b-1)/b;}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
void o(){cout<<"!?"<<endl;}
template<typename T>void o(T a){cout<<a<<endl;}
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
vector<int> dx = {0,1,0,-1,1,1,-1,-1};
vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}

using mint = modint998244353;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}
istream &operator>>(istream &is,vector<mint> &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;}

void solve(){
    int n; cin >> n;
    vector<int> a(n); cin >> a;
    vector<int> ps(1'000'001,1);
    map<int,int> mp;
    int idx = 0;
    repp(i,1'000'001,2){
        if (ps[i] != 1) continue;
        for (int j = i; j < 1'000'001; j += i) ps[j] = i;
        mp[i] = idx;
        idx++;
    }
    mint ans = 0;
    vector<mint> dp(1'000'001,0);
    rep(i,n){
        vector<int> qs;
        int ix = a[i];
        while (ix > 1){
            qs.emplace_back(ps[ix]);
            ix /= ps[ix];
        }
        uniq(qs);
        mint ima = 1;
        int m = qs.size();
        repp(j,1<<m,1){
            int c = 0;
            int y = 1;
            mint pl = 0;
            rep(k,m) if (j >> k & 1){
                c ^= 1;
                y *= qs[k];
            }
            ima += (c == 1 ? 1 : -1) * dp[y];
        }
        ans += ima;
        repp(j,1<<m,1){
            int y = 1;
            rep(k,m) if (j >> k & 1) y *= qs[k];
            dp[y] += ima;
        }
    }
    out(ans.val());
}

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
}
0