CF500C.New Year Book Reading

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has nn books numbered by integers from 1 to nn . The weight of the ii -th ( 1<=i<=n1<=i<=n ) book is wiw_{i} .

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

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

He decided to read books for mm days. In the jj -th ( 1<=j<=m1<=j<=m ) day, he will read the book that is numbered with integer bjb_{j} ( 1<=bj<=n1<=b_{j}<=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 mm 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?

输入格式

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

The second line contains nn space-separated integers w1,w2,...,wnw_{1},w_{2},...,w_{n} ( 1<=wi<=1001<=w_{i}<=100 ) — the weight of each book.

The third line contains mm space separated integers b1,b2,...,bmb_{1},b_{2},...,b_{m} ( 1<=bj<=n1<=b_{j}<=n ) — the order of books that he would read. Note that he can read the same book more than once.

输出格式

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

输入输出样例

  • 输入#1

    3 5
    1 2 3
    1 3 2 3 1
    

    输出#1

    12
    

说明/提示

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

首页