#840977 (C++17) No.2218 Multiple LIS

• 問題: No.2218 Multiple LIS
• ユーザー: apricity
• 提出日時: 2023-02-17 21:48:15
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 58 ms / 3,000 ms
• コード長: 5,178 bytes
• コンパイル時間: 1,329 ms
• コンパイル使用メモリ: 136,124 KB
• 実行使用メモリ: 4,808 KB
• 最終ジャッジ日時: 2023-09-26 19:04:23
• 合計ジャッジ時間: 3,722 ms
• ジャッジサーバーID （参考情報）: judge13 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	5 ms; 4,384 KB
testcase_01	AC	5 ms; 4,388 KB
testcase_02	AC	5 ms; 4,376 KB
testcase_03	AC	5 ms; 4,380 KB
testcase_04	AC	5 ms; 4,380 KB
testcase_05	AC	5 ms; 4,380 KB
testcase_06	AC	5 ms; 4,396 KB
testcase_07	AC	5 ms; 4,380 KB
testcase_08	AC	5 ms; 4,572 KB
testcase_09	AC	5 ms; 4,384 KB
testcase_10	AC	5 ms; 4,380 KB
testcase_11	AC	5 ms; 4,384 KB
testcase_12	AC	5 ms; 4,380 KB
testcase_13	AC	6 ms; 4,488 KB
testcase_14	AC	5 ms; 4,380 KB
testcase_15	AC	5 ms; 4,376 KB
testcase_16	AC	5 ms; 4,380 KB
testcase_17	AC	5 ms; 4,380 KB
testcase_18	AC	5 ms; 4,384 KB
testcase_19	AC	5 ms; 4,380 KB
testcase_20	AC	5 ms; 4,380 KB
testcase_21	AC	7 ms; 4,380 KB
testcase_22	AC	20 ms; 4,380 KB
testcase_23	AC	29 ms; 4,644 KB
testcase_24	AC	11 ms; 4,376 KB
testcase_25	AC	33 ms; 4,576 KB
testcase_26	AC	45 ms; 4,772 KB
testcase_27	AC	44 ms; 4,632 KB
testcase_28	AC	44 ms; 4,664 KB
testcase_29	AC	44 ms; 4,552 KB
testcase_30	AC	44 ms; 4,560 KB
testcase_31	AC	42 ms; 4,632 KB
testcase_32	AC	42 ms; 4,632 KB
testcase_33	AC	41 ms; 4,556 KB
testcase_34	AC	41 ms; 4,644 KB
testcase_35	AC	42 ms; 4,808 KB
testcase_36	AC	14 ms; 4,648 KB
testcase_37	AC	58 ms; 4,640 KB
testcase_38	AC	5 ms; 4,376 KB
testcase_39	AC	5 ms; 4,380 KB
testcase_40	AC	54 ms; 4,568 KB
testcase_41	AC	55 ms; 4,584 KB

ソースコード

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
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; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

struct eratosthenes{
    vector<bool> isprime;
    vector<int> minfactor;
    vector<int> mobius;
    eratosthenes(int n) : isprime(n+1,true), minfactor(n+1, -1), mobius(n+1,1){
        isprime[1] = false;
        minfactor[1] = 1;
 
        for(int i = 2; i <= n; i++){
            if(!isprime[i]) continue;
            minfactor[i] = i;
            mobius[i] = -1;
            for(int j = i+i; j <= n; j += i){
                isprime[j] = false;
                if(minfactor[j] == -1) minfactor[j] = i;
                if((j/i)%i == 0) mobius[j] = 0;
                else mobius[j] *= -1;
            }
        }
    }
 
    vector<pair<int, int>> factorize(int n){
        vector<pair<int, int>> res;
        while(n > 1){
            int p = minfactor[n];
            int e = 0;
            while(minfactor[n] == p){
                n /= p;
                e++;
            }
            res.push_back({p,e});
        }
        return res;
    }
 
    vector<int> divisor(int n){
        vector<int> res;
        res.pb(1);
        auto v = factorize(n);
        for(auto x : v){
            int s = res.size();
            rep(i,s){
                int m = 1;
                rep(j,x.second){
                    m *= x.first;
                    res.push_back(res[i]*m);
                }
            }
        }
        return res;
    }
 
    template<class T> void fzt(vector<T> &f){
        int n = f.size();
        for(int p = 2; p < n; p++){
            if(!isprime[p]) continue;
            for(int q = (n-1)/p; q > 0; q--){
                f[q] += f[p*q];
            }
        }
    }
 
 
    template<class T> void fmt(vector<T> &f){
        int n = f.size();
        for(int p = 2; p < n; p++){
            if(!isprime[p]) continue;
            for(int q = 1; q*p < n; q++){
                f[q] -= f[p*q];
            }
        }
    }
 
    template<class T> vector<T> conv(const vector<T> &f, const vector<T> &g){
        int n = max(f.size(), g.size());
        vector<T> nf(n), ng(n), h(n);
        rep(i,f.size()) nf[i] = f[i];
        rep(i,g.size()) ng[i] = g[i];
        fzt(nf); fzt(ng);
        rep(i,n) h[i] = nf[i]*ng[i];
        fmt(h);
        return h;
    }
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; in(n);
    int mx = 100000;
    eratosthenes si(mx+1);
    vector<int> a(n); in(a);
    vector<int> dp(mx+1,0);
    rep(i,n){
        auto f = si.divisor(a[i]);
        int tmp = 0;
        for(int e : f){
            chmax(tmp, dp[e]+1);
        }
        chmax(dp[a[i]],tmp);
        // FOR(i,1,6) out(dp[i]);
        //     outr("\n");
    }

    int ans = 0;
    rep(i,n) chmax(ans, dp[a[i]]);
    out(ans);
}