CodeForces 703B Mishka and trip（城市省会修路，待AC）

http://codeforces.com/problemset/problem/703/B

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

Note

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.

题意：

（对这个显示器也是佩服昂）/* 昨天晚上在自己笔记本看的是 ci - cj ，愣是没看出来！可能自己的本该退役了。*/

回到正题，就是求每个城市之间的价值距离综合，规则如下：

每个城市都要求与省会有直接的到达公路，公路的价值是两个城市价值的乘积。

思路：

使用一个结构体进行模拟。

标记是省会的城市，进行一次 sort 把它们移动到最前面，看代码（超时的昂！！）。

Code（超时版本等待优化）：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int MYDD=1103+1e5;
typedef __int64 ll;

struct C {
	int id;//城市价值
	int isid;//是否为省会
} c[MYDD];
bool cmp(C x,C y) {
	if(x.isid!=y.isid)
		return x.isid>y.isid;
	return x.id<y.id;
}

int main() {
	int n,k;
	while(scanf("%d%d",&n,&k)!=EOF) {
		for(int j=1; j<=n; j++)   c[j].isid=0;
		ll price=0;

		for(int j=1; j<=n; j++) {
			scanf("%d",&c[j].id);
		}
		for(int j=0; j<k; j++) {
			int v;
			scanf("%d",&v);
			c[v].isid=1;
		}

		if(!c[1].isid&&!c[n].isid)
			price=c[1].id*c[n].id;

		for(int j=1; j<n; j++) {
			if(!c[j].isid&&!c[j+1].isid) {
				price=price+c[j].id*c[j+1].id;
			}
		}

		sort(c+1,c+1+n,cmp);
		for(int j=1; j<=k; j++) {//当前是省会和每一个城市都要有路
			int v=j+1;
			while(v<=n) {
				price=price+c[j].id*c[v].id;
				v++;
			}
		}
		printf("%I64d\n",price);
	}
	return 0;
}