1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
| #include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
using namespace std;
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e17)+9;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;const double pi=acos(-1.0);
ll N,M,Q,X,K,lT,C[MAXN],W[MAXN];
ll dp[MAXN];
inline void init(){
}
vector<ll> minp,primes;
void sieve(ll n){
minp.assign(n+5,0);
for(int i=2;i<=n;++i){
if(minp[i]==0){
minp[i]=i;
primes.push_back(i);
}
for(auto p:primes){
if(i*p>n){
break;
}
minp[i*p]=p;
if(p==minp[i]){
break;
}
}
}
}
inline void solve(){
cin>>N;
init();
FOR(i,1,N){
cin>>W[i];
}
FOR(i,1,N){
cin>>C[i];
}
ll mxw=*max_element(W+1,W+1+N);
sieve(mxw);
vector<ll> dp(mxw+5,0),dp2(mxw+5,0),col(mxw+5,0);
for(int i=1;i<=N;++i){
vector<ll> prs;
for(int j=W[i];j>1;j/=minp[j]){
ll p=minp[j];
prs.pb(p);
}
sort(all(prs));
prs.resize(unique(all(prs))-prs.begin());
ll mx=0;
for(auto p:prs){
if(col[p]!=C[i]){
mx=max(mx,dp[p]+1);
}else{
mx=max(mx,dp2[p]+1);
}
}
for(auto p:prs){
if(col[p]!=C[i]){
if(mx>dp[p]){
dp2[p]=dp[p];
dp[p]=mx;
col[p]=C[i];
}else if(mx>dp2[p]){
dp2[p]=mx;
}
}else{
if(mx>dp[p]) dp[p]=mx;
}
}
}
ll ans=1;
for(int i=2;i<=mxw;++i){
ans=max({ans,dp[i],dp2[i]});
}
cout<<ans<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
solve();
return 0;
}
|