Fox And Jumping - CodeForces 510 D

Fox And Jumping

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.

There are also n cards, each card has 2 attributes: length li and cost ci. If she pays ci dollars then she can apply i-th card. After applying i-th card she becomes able to make jumps of length li, i. e. from cell x to cell (x - li) or cell (x + li).

She wants to be able to jump to any cell on the tape (possibly, visiting some intermediate cells). For achieving this goal, she wants to buy some cards, paying as little money as possible.

If this is possible, calculate the minimal cost.

Input

The first line contains an integer n (1 ≤ n ≤ 300), number of cards.

The second line contains n numbers li (1 ≤ li ≤ 109), the jump lengths of cards.

The third line contains n numbers ci (1 ≤ ci ≤ 105), the costs of cards.

Output

If it is impossible to buy some cards and become able to jump to any cell, output -1. Otherwise output the minimal cost of buying such set of cards.

Sample test(s)

input

3
100 99 9900
1 1 1

output

2

input

5
10 20 30 40 50
1 1 1 1 1

output

-1

input

7
15015 10010 6006 4290 2730 2310 1
1 1 1 1 1 1 10

output

6

input

8
4264 4921 6321 6984 2316 8432 6120 1026
4264 4921 6321 6984 2316 8432 6120 1026

output

7237

Note

In first sample test, buying one card is not enough: for example, if you buy a card with length 100, you can't jump to any cell whose index is not a multiple of 100. The best way is to buy first and second card, that will make you be able to jump to any cell.

In the second sample test, even if you buy all cards, you can't jump to any cell whose index is not a multiple of 10, so you should output -1.

题意：选出其中n张牌使得它可以走到任意格上，如果可以的话要求花费最小。

思路：满足答案的这些数，要求他们的gcd=1，每次选取最大的数，和其他数去求gcd，然后更新这些数的花费，一直到最后，1的花费便是最后的答案。

           比赛时感觉这个做法可能会超时，就没敢写，后来看那么多人都过了，才在最后20分钟赶着写出来的。。。用了一下优先队列~~~其实不用也可以。

AC代码如下：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
struct node
{
    int num;
    bool operator<(const node a)const
    {
        return a.num>num;
    }
};
int T,t,n,m,num[310],cost[310];
priority_queue<node> qu[2];
int gcd(int a,int b)
{
    return b==0 ? a :gcd(b,a%b);
}
map<int,int> match;
node A,B,C;
int main()
{
    int i,j,k,a,b,val;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&num[i]);
    for(i=1;i<=n;i++)
        scanf("%d",&cost[i]);
    k=num[1];
    for(i=1;i<=n;i++)
       k=gcd(k,num[i]);
    if(k!=1)
      printf("-1\n");
    else
    {
        for(i=1;i<=n;i++)
        {
            if(match[num[i]]==0)
              match[num[i]]=cost[i];
            else
              match[num[i]]=min(match[num[i]],cost[i]);
            A.num=num[i];
            qu[0].push(A);
        }
        a=1;b=0;
        while(true)
        {
            a=a^1;b=b^1;
            if(qu[a].empty())
              break;
            A=qu[a].top();
            qu[a].pop();
            val=A.num;
            while(!qu[a].empty())
            {
                B=qu[a].top();
                qu[a].pop();
                if(B.num==val)
                  continue;
                val=B.num;
                qu[b].push(B);
                C.num=gcd(A.num,B.num);
                if(C.num>1)
                 qu[b].push(C);
                if(match[C.num]==0)
                  match[C.num]=match[A.num]+match[B.num];
                else
                  match[C.num]=min(match[C.num],match[A.num]+match[B.num]);
            }
        }
        printf("%d\n",match[1]);
    }

}