CodeForces 518C

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=120930#problem/C

C - Watto and Mechanism

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

Submit  Status  Practice  CodeForces 518C

Description

Anya has bought a new smartphone that uses Berdroid operating system. The smartphone menu has exactly n applications, each application has its own icon. The icons are located on different screens, one screen contains k icons. The icons from the first to the k-th one are located on the first screen, from the (k + 1)-th to the 2k-th ones are on the second screen and so on (the last screen may be partially empty).

Initially the smartphone menu is showing the screen number 1. To launch the application with the icon located on the screen t, Anya needs to make the following gestures: first she scrolls to the required screen number t, by making t - 1 gestures (if the icon is on the screen t), and then make another gesture — press the icon of the required application exactly once to launch it.

After the application is launched, the menu returns to the first screen. That is, to launch the next application you need to scroll through the menu again starting from the screen number 1.

All applications are numbered from 1 to n. We know a certain order in which the icons of the applications are located in the menu at the beginning, but it changes as long as you use the operating system. Berdroid is intelligent system, so it changes the order of the icons by moving the more frequently used icons to the beginning of the list. Formally, right after an application is launched, Berdroid swaps the application icon and the icon of a preceding application (that is, the icon of an application on the position that is smaller by one in the order of menu). The preceding icon may possibly be located on the adjacent screen. The only exception is when the icon of the launched application already occupies the first place, in this case the icon arrangement doesn't change.

Anya has planned the order in which she will launch applications. How many gestures should Anya make to launch the applications in the planned order?

Note that one application may be launched multiple times.

Input

The first line of the input contains three numbers n, m, k (1 ≤ n, m, k ≤ 10⁵) — the number of applications that Anya has on her smartphone, the number of applications that will be launched and the number of icons that are located on the same screen.

The next line contains n integers, permutation a₁, a₂, ..., a_n — the initial order of icons from left to right in the menu (from the first to the last one), a_i —  is the id of the application, whose icon goes i-th in the menu. Each integer from 1 to n occurs exactly once among a_i.

The third line contains m integers b₁, b₂, ..., b_m(1 ≤ b_i ≤ n) — the ids of the launched applications in the planned order. One application may be launched multiple times.

Output

Print a single number — the number of gestures that Anya needs to make to launch all the applications in the desired order.

Sample Input

Input

8 3 3
1 2 3 4 5 6 7 8
7 8 1

Output

7

Input

5 4 2
3 1 5 2 4
4 4 4 4

Output

8

Hint

In the first test the initial configuration looks like (123)(456)(78), that is, the first screen contains icons of applications 1, 2, 3, the second screen contains icons 4, 5, 6, the third screen contains icons 7, 8.

After application 7 is launched, we get the new arrangement of the icons — (123)(457)(68). To launch it Anya makes 3 gestures.

After application 8 is launched, we get configuration (123)(457)(86). To launch it Anya makes 3 gestures.

After application 1 is launched, the arrangement of icons in the menu doesn't change. To launch it Anya makes 1 gesture.

In total, Anya makes 7 gestures.

题意: 一手机上,总共有n个应用,每个页面有k个应用,Anya要打开其中的m个应用,每个应用被打开后它的位置会往前移动一,输入n,m,k,以及初始时应用的顺序求点开所有应用需要多少个操作

暴力超时:最多10的5次方个应用,点开的个数也可以是10的5次方,假如每个应用都在最后面,那么每个应用都需要遍历一遍所有应用来找到要点开的应用,复杂度为100亿

解决超时的方法:开一个ra数组保存下每个应用的位置. 输入应用编号就可以得到其位置而不需要遍历

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn=1000005;
int a[maxn],ra[maxn];
int main(){
    int n,m,k;
    while(~scanf("%d%d%d",&n,&m,&k)){
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            ra[ a[i] ] = i;
        }
        int t;
        ll cnt=0;
        for(int i=0;i<m;i++){
            scanf("%d",&t);
            int j=ra[t];
            if((j+1)%k==0)cnt+=(j+1)/k;
            else cnt+=((j+1)/k+1);
            if(j!=0){
                swap(a[j],a[j-1]);
                swap(ra[t],ra[ a[j] ]);
            }
        }
        cout<<cnt<<endl;
    }
    return 0;
}