zoukankan      html  css  js  c++  java
  • CodeForces

    B. 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.

    Examples
    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.

     

    #include<map>
    #include<cstdio>
    using namespace std;
    const int N=1e5+5;
    int n,c[N],l[N];
    map<int,int>f;
    map<int,int>::iterator it;
    int gcd(int a,int b){return !b?a:gcd(b,a%b);}
    int main(){
        scanf("%d",&n);
        for(int i=1;i<=n;i++) scanf("%d",&l[i]);
        for(int i=1;i<=n;i++) scanf("%d",&c[i]);
        for(int i=1;i<=n;i++) if(!f.count(l[i])) f[l[i]]=c[i];else f[l[i]]=min(f[l[i]],c[i]);
        for(int i=1;i<=n;i++){
            for(it=f.begin();it!=f.end();it++){
                if(it->first==l[i]) continue;
                int t=gcd(l[i],it->first);
                if(!f.count(t)) f[t]=it->second+c[i];
                else f[t]=min(f[t],it->second+c[i]);
            }
        }
        printf("%d
    ",f[1]?f[1]:-1);
        return 0;
    } 
  • 相关阅读:
    Hadoop压缩
    Hive数据倾斜总结
    DQL、DML、DDL、DCL
    HashMap/HashSet,hashCode,哈希表
    HashMap详解
    Hive分区和桶
    String不可变StringBuffer可变
    Java线程和守护进程
    Ambari安装小记
    P3
  • 原文地址:https://www.cnblogs.com/shenben/p/6711158.html
Copyright © 2011-2022 走看看