CodeForces - 703B

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 every 1 ≤ 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 between a 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.

Example
Input
4 1
2 3 1 2
3
Output
17
Input
5 2
3 5 2 2 4
1 4
Output
71

水题但是有个结论比较重要
一个图每个点都和其他点相连
这样图的总长度是每个点连其他所有点总长度/2

#include<iostream>
#include<algorithm>
#include<map>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
long long tu[100001],ts[100001],biaoji[100001];
int main()
{
#define int long long 
    int n,m;
    cin >> n >> m;
    for (int a = 1; a <= n; a++)scanf("%d", &tu[a]);
    for (int a = 1; a <= m; a++)scanf("%d", &ts[a]);
    for (int a = 1; a <= m; a++)biaoji[ts[a]] = 1;
    int qw = 0;
    for (int a = 2; a <= n; a++)
    {
        if (biaoji[a])continue;
        if (!biaoji[a - 1])qw += tu[a] * tu[a - 1];
    }
    if (biaoji[1] == 0 && biaoji[n] == 0)qw += tu[1] * tu[n];
    int sum = 0, sum1 = 0;
    for (int a = 1; a <= n; a++)
    {
        if (biaoji[a])sum += tu[a];
        else sum1 += tu[a];
    }
    int wew = 0;
    for (int a = 1; a <= n; a++)
    {
        if (!biaoji[a])continue;
        qw += sum1*tu[a];
        wew += tu[a] * (sum - tu[a]);
    }
    qw += wew / 2;
    cout << qw;
}