結果

問題 No.2218 Multiple LIS
ユーザー noya2noya2
提出日時 2023-02-17 21:34:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 70 ms / 3,000 ms
コード長 9,173 bytes
コンパイル時間 4,764 ms
コンパイル使用メモリ 276,676 KB
実行使用メモリ 4,572 KB
最終ジャッジ日時 2023-09-26 18:44:39
合計ジャッジ時間 7,204 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 3 ms
4,376 KB
testcase_03 AC 3 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 3 ms
4,376 KB
testcase_06 AC 3 ms
4,380 KB
testcase_07 AC 3 ms
4,376 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 3 ms
4,380 KB
testcase_12 AC 3 ms
4,380 KB
testcase_13 AC 3 ms
4,376 KB
testcase_14 AC 3 ms
4,380 KB
testcase_15 AC 3 ms
4,380 KB
testcase_16 AC 3 ms
4,380 KB
testcase_17 AC 3 ms
4,376 KB
testcase_18 AC 3 ms
4,380 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 3 ms
4,384 KB
testcase_21 AC 6 ms
4,380 KB
testcase_22 AC 22 ms
4,380 KB
testcase_23 AC 36 ms
4,376 KB
testcase_24 AC 9 ms
4,380 KB
testcase_25 AC 40 ms
4,380 KB
testcase_26 AC 56 ms
4,476 KB
testcase_27 AC 56 ms
4,484 KB
testcase_28 AC 56 ms
4,572 KB
testcase_29 AC 57 ms
4,464 KB
testcase_30 AC 57 ms
4,428 KB
testcase_31 AC 42 ms
4,424 KB
testcase_32 AC 42 ms
4,472 KB
testcase_33 AC 42 ms
4,436 KB
testcase_34 AC 42 ms
4,484 KB
testcase_35 AC 42 ms
4,484 KB
testcase_36 AC 11 ms
4,492 KB
testcase_37 AC 70 ms
4,484 KB
testcase_38 AC 3 ms
4,380 KB
testcase_39 AC 3 ms
4,380 KB
testcase_40 AC 59 ms
4,476 KB
testcase_41 AC 59 ms
4,480 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 reb(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 ull = unsigned 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>;
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> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
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){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
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); }
void print(unsigned long long a) { printf("%llu", 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; }
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();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
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;}

#line 2 "math.hpp"

#line 6 "math.hpp"

namespace noya2{

using namespace std;
using ll = long long;

template<typename T> T sqrt_safe(T x){ // floor(sqrt(x))
    assert(x >= T(0));
    if (x <= T(1)) return x;
    T tmp = (T)(sqrtl((long double)(x))) + T(2);
    while (tmp--){
        if (tmp * tmp <= x) break;
    }
    return tmp;
}


ll mod_safe(ll a, ll m){ // m >= 1, 0 <= mod_safe(a,m) < m, mod_safe(a,m) = a (mod m)
    ll res = a % m;
    if (res < 0) res += m;
    return res;
}
ll modpow(ll x, ll n, ll mod){
    x = mod_safe(x,mod);
    if (n == 0) return 1;
    ll res = modpow(x,n/2,mod);
    res = (res * res) % mod;
    if (n % 2 == 1) res = (res * x) % mod;
    return res;
}

ll naive_gcd(ll a, ll b){ return b ? naive_gcd(b, a % b) : a; }

// gcd(N >= 0, 0) = N, especialy gcd(0, 0) = 0
ll gcd_safe(ll a, ll b){ return naive_gcd(abs(a),abs(b)); }
ll lcm_safe(ll a, ll b){ return a / gcd_safe(a,b) * b; }

void ext_gcd1_plus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax + by = 1
    if (b == 0){ // a = 1
        x = 1, y = 0;
        return ;
    }
    ext_gcd1_plus(b, a%b, y, x);
    x = mod_safe(x,b);
    y = (1 - a * x) / b;
}
void ext_gcd1_minus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax - by = 1
    if (b == 0){ // a = 1
        x = 1, y = 0;
        return ;
    }
    ext_gcd1_plus(b, a%b, y, x);
    x = mod_safe(x,b);
    y = (a * x - 1) / b;
}

pair<ll,ll> ext_gcd(ll a, ll b, ll c){ // ax + by = c, |a|,|b|,|c| < 1e9, x <= max(|B|,|C|), y <= max(|A|,|C|)
    if (a < 0) return ext_gcd(-a,-b,-c);
    if (c < 0){
        pair<ll,ll> res = ext_gcd(a,b,-c);
        res.first = -res.first, res.second = -res.second;
        return res;
    }
    if (c == 0) return pair<ll,ll>(0,0);
    if (a == 0 && b == 0) return pair<ll,ll>(0,0); // answer not exist
    ll g = gcd_safe(a,b);
    if (c % g != 0) return pair<ll,ll>(0,0); // answer not exist
    a /= g, b /= g, c /= g;
    ll x, y;
    if (b == 0) return pair<ll,ll>(c,0);
    if (b > 0) ext_gcd1_plus(a,b,x,y);
    else ext_gcd1_minus(a,-b,x,y);
    x = mod_safe(x*c,abs(b));
    y = (c - a * x) / b;
    return pair<ll,ll>(x,y);
}

template<typename T>
T ceil_safe(T p, T q);

template<typename T>
T floor_safe(T p, T q){
    if (q < T(0)) return floor_safe(-p,-q);
    if (p >= T(0)) return p / q;
    return -ceil_safe(-p,q);
}

template<typename T>
T ceil_safe(T p, T q){
    if (q < T(0)) return ceil_safe(-p,-q);
    if (p >= T(0)) return (p + q - 1) / q;
    return -floor_safe(-p,q);
}

struct Eratosthenes{
    static vector<int> table;
    Eratosthenes (int Nmax = -1) {init(Nmax);}
    static void init(int Nmax){
        if (!table.empty()) return ;
        table.resize(Nmax+1,0);
        table[0] = 1, table[1] = 1;
        for (int p = 2; p <= Nmax; p++){
            if (table[p] != 0) continue;
            for (int j = p; j <= Nmax; j += p){
                table[j] = p;
            }
        }
    }
};
vector<int>Eratosthenes::table = vector<int>(0);

void build_eratosthenes(const int Nmax){Eratosthenes::init(Nmax);}

vector<pair<int,int>> fast_prime_factorization(int N){
    int pre = -1, cnt = 0;
    vector<pair<int,int>> res;
    while(true) {
        if (N == 1){
            if (cnt > 0) res.emplace_back(pre,cnt);
            break;
        }
        int div = Eratosthenes::table[N];
        if (pre != div){
            if (cnt > 0) res.emplace_back(pre,cnt);
            pre = div, cnt = 1;
        }
        else cnt++;
        N /= div;
    }
    return res;
}

vector<int> fast_divisor_enumeration(int N){
    auto pes = fast_prime_factorization(N);
    vector<int> res = {1};
    for (auto pe : pes){
        vector<int> nres;
        for (auto x : res){
            for (int _t = 0; _t <= pe.second; _t++){
                nres.emplace_back(x);
                x *= pe.first;
            }
        }
        swap(res,nres);
    }
    return res;
}

bool fast_is_prime(int N){
    if (N <= 1) return false;
    return Eratosthenes::table[N] == N;
}

vector<int> mobius(int N){
    vector<int> res(N+1,0);
    res[1] = 1;
    for (int p = 2; p <= N; p++){
        if (fast_is_prime(p)){
            for (int i = N/p; i > 0; i--){
                res[i*p] = -res[i];
            }
        }
    }
    return res;
};

vector<pair<ll,int>> prime_factorization(ll N){
    vector<pair<ll,int>> res;
    ll iN = N;
    for (ll d = 2; d * d <= N; d++){
        if (iN % d != 0) continue;
        if (iN == 1) break;
        int ie = 0;
        while (iN % d == 0) iN /= d, ie++;
        res.emplace_back(d,ie);
    }
    if (iN != 1) res.emplace_back(iN,1);
    return res;
}

vector<ll> divisor_enumeration(ll N){
    vector<ll> res;
    for (ll d = 1; d * d <= N; d++){
        if (N % d != 0) continue;
        res.emplace_back(d);
        if (d * d != N) res.emplace_back(N/d);
    }
    return res;
}

bool is_prime(ll N){
    if (N <= 1) return false;
    if (N <= 3) return true;
    if (N % 2 == 0) return false;
    for (ll d = 3; d * d <= N; d += 2){
        if (N % d == 0) return false;
    }
    return true;
}

}// namespace noya2
#line 78 "c.cpp"

void solve(){
    int n; cin >> n;
    vector<int> a(n); cin >> a;
    const int mx = 100000;
    build_eratosthenes(mx);
    vector<int> dp(mx+1,-INF);
    dp[1] = 0;
    int ans = 1;
    rep(i,n){
        int ma = 0;
        for (int d : fast_divisor_enumeration(a[i])){
            chmax(ma,dp[d]+1);
        }
        chmax(ans,ma);
        chmax(dp[a[i]],ma);
    }
    out(ans);
}

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