Codeforces Round #365 (Div. 2) [B] Mishka and trip

最新推荐文章于 2017-01-19 22:33:50 发布

原创最新推荐文章于 2017-01-19 22:33:50 发布 · 486 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

其他类型专栏收录该内容

27 篇文章

订阅专栏

Mishka 计划访问一个由 n 个城市组成的国家，其中有 k 个首都城市。每个城市的美丽值不同，首都城市与其他所有城市直接相连。任务是计算所有道路通过费用的总和。

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:

XXX consists of n cities, k of whose (just imagine!) are capital cities.
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.
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.
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.
There is at most one road between any two cities.
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

Note

This image describes first sample case:

$\text{[math]}$

It is easy to see that summary price is equal to 17.

This image describes second sample case:

$\text{[math]}$

It is easy to see that summary price is equal to 71.

基本思路:

1.计算环的权值和

2.计算capital city要连的边的权值和

2.减去重边的权值和，注意这里的重边只会出现在首都与首都之间

#include<iostream>
#include<cstdio>
#define LL long long
using namespace std;
const LL maxn=100005;
LL n,k,a[maxn],b[maxn],num[maxn];
bool mark[maxn];
int main(){
    cin>>n>>k;
    LL sum=0,ans=0,i;
    for(i=1;i<=n;i++){
      scanf("%I64d",&a[i]);
      sum+=a[i];
    }
    for(i=1;i<=k;i++){
      scanf("%I64d",&b[i]);
      num[i]=num[i-1]+a[b[i]];
      mark[b[i]]=1;
    }
    for(LL i=1;i<n;i++)ans+=a[i]*a[i+1];
    ans+=a[n]*a[1];
    a[0]=a[n],a[n+1]=a[1];
    for(i=1;i<=k;i++)
        ans+=a[b[i]]*(sum-a[b[i]]-a[b[i]-1]-a[b[i]+1]);
    for(i=1;i<=k;i++){
        LL exm=num[k]-num[i];
        if(b[i]==n)break;
        if(b[i]==1){
            if(mark[2])exm-=a[2];
            if(mark[n])exm-=a[n];
            ans-=exm*a[b[i]];
        }
        else{
          if(mark[b[i]+1])
          exm-=a[b[i]+1];
          ans-=exm*a[b[i]];
        }
    }
    cout<<ans;
}