Mishka and trip 道路权值和

Mishka and trip

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 703B

Appoint description:  System Crawler  (Aug 15, 2016 11:19:01 AM)

Description

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 c_i.
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 every 1 ≤ 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 c_i·c_j.

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 c_a·c_b. 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 c₁, c₂, ..., c_n (1 ≤ c_i ≤ 10 000) — beauty values of the cities.

The third line of the input contains k distinct integers id₁, id₂, ..., id_k (1 ≤ id_i ≤ 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.

Sample Input

Input

4 1
2 3 1 2
3

Output

17

Input

5 2
3 5 2 2 4
1 4

Output

71

Hint

This image describes first sample case:

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

This image describes second sample case:

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

题意：有N个城市，有各自的魅力值v,每条路的魅力值等于连接的两个城市魅力值乘积
             两个城市间最多一条路，有k个特殊城市，和其他每个城市都有连接，求所有路的魅力值之和 

 题解：见代码注释，就能秒懂o(≧v≦)o~~

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

#include<cstdio>
#include<cstring>
int val[100005],vis[100005];
int main()
{
	int n,k;
	while(~scanf("%d%d",&n,&k))
	{
		long long city_sum=0,capital_sum=0;
		for(int i=1;i<=n;i++)
			{
				scanf("%d",&val[i]);
				city_sum+=val[i];//所有城市权值和 
			}
			memset(vis,0,sizeof(vis));
			int x;
			for(int i=1;i<=k;i++)
			{
				scanf("%d",&x);
				vis[x]=1;//标记首都城市 
				capital_sum+=val[x];//首都城市权值和 
			}
			long long rest=0;
			for(int i=1;i<=n;i++)
			{
				if(vis[i]==1)//是首都城市
				rest+=(city_sum-val[i])*val[i];//除去本身，与其他所有城市连接
				
				else//如果不是首都城市，只与所有首都城市及与它相邻的城市连接 
				{
				    long long t=capital_sum;
				if(i==1)
					{
					if(!vis[n]) t+=val[n];//相邻城市不是首都城市

                                                              //则加上它的权值 
					if(!vis[2])  t+=val[2];
					 } 
				else if(i==n)
					 {
					 	if(!vis[1]) t+=val[1];
					 	if(!vis[n-1]) t+=val[n-1];
					 }
			        else
					 {
					 	if(!vis[i-1]) t+=val[i-1];
						 if(!vis[i+1]) t+=val[i+1]; 
					 }
					 rest+=t*val[i];
				 } 
			 } 
			 printf("%lld\n",rest/2);//每条道路两个点都考虑了，重复了一遍
		
	}
	return 0;
}