codeforces500C. New Year Book Reading

C. New Year Book Reading

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.

As Jaehyun's house is not large enough to have a bookshelf, he keeps the n books by stacking them vertically. When he wants to read a certain book x, he follows the steps described below.

1. He lifts all the books above book x.
2. He pushes book x out of the stack.
3. He puts down the lifted books without changing their order.
4. After reading book x, he puts book x on the top of the stack.

He decided to read books for m days. In the j-th (1 ≤ j ≤ m) day, he will read the book that is numbered with integer bj (1 ≤ bj ≤ n). To read the book, he has to use the process described in the paragraph above. It is possible that he decides to re-read the same book several times.

After making this plan, he realized that the total weight of books he should lift during m days would be too heavy. So, he decided to change the order of the stacked books before the New Year comes, and minimize the total weight. You may assume that books can be stacked in any possible order. Note that book that he is going to read on certain step isn't considered as lifted on that step. Can you help him?

Input

The first line contains two space-separated integers n (2 ≤ n ≤ 500) and m (1 ≤ m ≤ 1000) — the number of books, and the number of days for which Jaehyun would read books.

The second line contains n space-separated integers w1, w2, ..., wn (1 ≤ wi ≤ 100) — the weight of each book.

The third line contains m space separated integers b1, b2, ..., bm (1 ≤ bj ≤ n) — the order of books that he would read. Note that he can read the same book more than once.

Output

Print the minimum total weight of books he should lift, which can be achieved by rearranging the order of stacked books.

Examples

input

3 5
1 2 3
1 3 2 3 1

output

12

Note

Here's a picture depicting the example. Each vertical column presents the stacked books.

题解：

贪心

考虑每本书的放置 因为要使得总重量最小 又因为每次操作在他之前的操作都会使这本书之前要读的书已经摞在它上面 所以按读书顺序放置最优

如果这本书之前已经看过 那么如果是他保持在原来的位置一定在按上述策略贪心位置的上面 所以不需要移动

操作可以用链表实现

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=1000+10;
int pl[maxn];
int w[maxn];
int next[maxn];
int pre[maxn];
int id[maxn];
int d[maxn];
int C[maxn];
int ti;
inline int bs(int x){
	int l=1,r=ti;
	while(l+1<r){
		int mid=(l+r)>>1;
		if(C[mid]>=x)
			r=mid;
		else l=mid+1;
	}
	if(C[l]==x)
		return l;
	return r;
}
int main(){
	freopen("eromanga.in","r",stdin);
	freopen("eromanga.out","w",stdout);
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)
		scanf("%d",&w[i]);
	memset(pl,127,sizeof(pl));
	for(int i=1;i<=m;i++){
		scanf("%d",&d[i]);
		pl[d[i]]=min(pl[d[i]],i);
	}
	int top;
	for(int i=1;i<=n;i++)
		if(pl[i]!=pl[0])
			C[++ti]=pl[i];
	sort(C+1,C+ti+1);
	for(int i=1;i<=n;i++){
		if(pl[i]!=pl[0]){
			int u=bs(pl[i]);
			id[u]=i;
		}
	}
	top=id[1];
	for(int i=1;i<ti;i++){
		next[id[i]]=id[i+1];
		pre[id[i+1]]=id[i];
	}
	long long ans=0;
	for(int i=1;i<=m;i++){
		int now=top;
		long long res=0;
		while(now!=d[i]){
			res+=w[now];
			now=next[now];
		}
		ans+=res;
		if(now!=top){
			next[pre[now]]=next[now];
			pre[next[now]]=pre[now];
			pre[now]=0;
			next[now]=top;
			pre[top]=now;
			top=now;
		}
	}
	printf("%lld\n",ans);
return 0;
}