因此dp,f[i]表示gcd=i的最小费用
质数不多随便做。
PS:注意map中没赋值的情况
PS2:l[i]可能重复,小心覆盖
PS3:事先给h[1]赋值INF时,要考虑l[i]中本来就有1的情况
wa到残。。。
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
#include<queue>
#include<map>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (300+300+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
priority_queue<int> q;
map<int,int> h;
int gcd(int a,int b){if (b==0) return a;return gcd(b,a%b);}
int n,l[MAXN],c[MAXN];
int main()
{
// freopen("Jumping.in","r",stdin);
// freopen(".out","w",stdout);
cin>>n;
For(i,n) scanf("%d",&l[i]);
For(i,n) scanf("%d",&c[i]);
For(i,n)
{
if (h.find(l[i])!=h.end())
{
h[l[i]]=min(h[l[i]],c[i]);
continue;
}
h[l[i]]=c[i],q.push(l[i]);
}
while (!q.empty())
{
int t=q.top();
q.pop();
For(i,n)
{
int t2=gcd(t,l[i]),c2=h[t]+h[l[i]];
// cout<<t2<<' '<<c2<<endl;
if (h.find(t2)==h.end()||h[t2]>c2)
{
h[t2]=c2;
q.push(t2);
}
}
}
if (h.find(1)==h.end()) cout<<"-1\n";
else cout<<h[1]<<endl;
return 0;
}