zoukankan      html  css  js  c++  java
  • codeforces 703B B. Mishka and trip(数学)

    题目链接:

    B. Mishka and trip

    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Little Mishka is a great traveller and she visited many countries. After thinking about where to travel this time, she chose XXX — beautiful, but little-known northern country.

    Here are some interesting facts about XXX:

    1. XXX consists of n cities, k of whose (just imagine!) are capital cities.
    2. All of cities in the country are beautiful, but each is beautiful in its own way. Beauty value of i-th city equals to ci.
    3. All the cities are consecutively connected by the roads, including 1-st and n-th city, forming a cyclic route 1 — 2 — ... — n — 1. Formally, for every 1 ≤ i < n there is a road between i-th and i + 1-th city, and another one between 1-st and n-th city.
    4. Each capital city is connected with each other city directly by the roads. Formally, if city x is a capital city, then for every1 ≤ i ≤ n,  i ≠ x, there is a road between cities x and i.
    5. There is at most one road between any two cities.
    6. Price of passing a road directly depends on beauty values of cities it connects. Thus if there is a road between cities i and j, price of passing it equals ci·cj.

    Mishka started to gather her things for a trip, but didn't still decide which route to follow and thus she asked you to help her determine summary price of passing each of the roads in XXX. Formally, for every pair of cities a and b (a < b), such that there is a road betweena and b you are to find sum of products ca·cb. Will you help her?

    Input

    The first line of the input contains two integers n and k (3 ≤ n ≤ 100 000, 1 ≤ k ≤ n) — the number of cities in XXX and the number of capital cities among them.

    The second line of the input contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 10 000) — beauty values of the cities.

    The third line of the input contains k distinct integers id1, id2, ..., idk (1 ≤ idi ≤ n) — indices of capital cities. Indices are given in ascending order.

    Output

    Print the only integer — summary price of passing each of the roads in XXX.

    Examples
    input
    4 1
    2 3 1 2
    3
    output
    17
    input
    5 2
    3 5 2 2 4
    1 4
    output
    71

    题意:

    现在给你这些道路,问你这些道路的权值的和是多少;

    思路:

    求个和,再加加减减就好了;

    AC代码:

    /************************************************
    ┆  ┏┓   ┏┓ ┆   
    ┆┏┛┻━━━┛┻┓ ┆
    ┆┃       ┃ ┆
    ┆┃   ━   ┃ ┆
    ┆┃ ┳┛ ┗┳ ┃ ┆
    ┆┃       ┃ ┆ 
    ┆┃   ┻   ┃ ┆
    ┆┗━┓    ┏━┛ ┆
    ┆  ┃    ┃  ┆      
    ┆  ┃    ┗━━━┓ ┆
    ┆  ┃  AC代马   ┣┓┆
    ┆  ┃           ┏┛┆
    ┆  ┗┓┓┏━┳┓┏┛ ┆
    ┆   ┃┫┫ ┃┫┫ ┆
    ┆   ┗┻┛ ┗┻┛ ┆      
    ************************************************ */ 
     
     
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <cmath>
    #include <bits/stdc++.h>
    #include <stack>
     
    using namespace std;
     
    #define For(i,j,n) for(int i=j;i<=n;i++)
    #define mst(ss,b) memset(ss,b,sizeof(ss));
     
    typedef  long long LL;
     
    template<class T> void read(T&num) {
        char CH; bool F=false;
        for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
        for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
        F && (num=-num);
    }
    int stk[70], tp;
    template<class T> inline void print(T p) {
        if(!p) { puts("0"); return; }
        while(p) stk[++ tp] = p%10, p/=10;
        while(tp) putchar(stk[tp--] + '0');
        putchar('
    ');
    }
     
    const LL mod=1e9+7;
    const double PI=acos(-1.0);
    const int inf=1e9;
    const int N=1e5+10;
    const int maxn=2e3+14;
    const double eps=1e-12;
    
    int vis[N];
    LL a[N];
    
    int main()
    {      
            int n,k;
            LL sum=0;
            read(n);read(k);
            For(i,1,n)
            {
                read(a[i]);
                sum=sum+a[i];
            }
            int u;
            For(i,1,k)
            {
                read(u);
                vis[u]=1;
            }
            LL ans=0,ans1=0;
            For(i,1,n-1)
            {
                if(vis[i])
                {
                    ans=ans+a[i]*(sum-a[i]);
                }
                else 
                {
                    if(vis[i+1])continue;
                    else ans=ans+a[i]*a[i+1];
                }
            }
            if(vis[n])ans=ans+a[n]*(sum-a[n]);
            else 
            {
                if(!vis[1]) ans=ans+a[1]*a[n];
            }
            sum=0;
            For(i,1,n)
            {
                if(vis[i])sum=sum+a[i];
            }
            For(i,1,n)
            {
                if(vis[i])
                {
                    ans1=ans1+(sum-a[i])*a[i];
                }
            }
            cout<<ans-ans1/2<<endl;
    
    
    
            return 0;
    }
    

      

  • 相关阅读:
    ActionBar Fragment的一个sample activity; 及获取runningAppProcess及跳转
    优化后台推送的service,减少被杀死的几率
    64位win7安装ubunto最新14.04的过程,及出现的问题的解决
    一次非线上iowait高的情况的检查
    一个愚蠢的python逻辑语法错误
    Bellman-Ford算法解决单源最短路问题
    Floyd算法解决多源最短路径问题
    最短路问题Dijkstra算法
    最小生成树之Kruskal算法
    最优二叉搜索树
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5751385.html
Copyright © 2011-2022 走看看