zoukankan      html  css  js  c++  java
  • Codeforces Round #293 (Div. 2) C. Anya and Smartphone 数学题

    C. Anya and Smartphone
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 ≤ 105) — 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 a1, a2, ..., an — the initial order of icons from left to right in the menu (from the first to the last one), ai —  is the id of the application, whose icon goes i-th in the menu. Each integer from 1 to n occurs exactly once among ai.

    The third line contains m integers b1, b2, ..., bm(1 ≤ bi ≤ 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 test(s)
    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
    note

    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个应用,要打开m个应用,智能机每页只能放k个应用

    然后问你这些应用需要多少次操作

    每次翻页,和点击应用需要一次操作

    题解:拿两个数组,其中一个数组记录这个位置的是哪个应用,和这个应用在哪个位置

    然后胡乱搞一搞就好了

    int n,m,k;
    int step[maxn];
    int loat[maxn];
    int main()
    {
            cin>>n>>m>>k;
            int tmp;
            for(int i=0;i<n;i++)
            {
                    cin>>tmp;
                    step[tmp]=i;
                    loat[i]=tmp;
            }
            LL ans=0;
            for(int i=0;i<m;i++)
            {
                    cin>>tmp;
                    ans+=step[tmp]/k+1;
                    if(step[tmp]==0)
                            continue;
                    loat[step[tmp]]=loat[step[tmp]-1];
                    step[tmp]--;
                    step[loat[step[tmp]]]++;
                    loat[step[tmp]]=tmp;
            }
            cout<<ans<<endl;
    }
  • 相关阅读:
    指针,数组,字符串的区别(高质量程序设计指南C++/C语言第7章)
    bitset初始化问题
    书籍
    编译器的工作过程
    C++函数传递指向指针的指针的应用
    程序员面试金典--二叉树的下一个结点
    程序员面试金典--对称的二叉树
    程序员面试金典--按之字形顺序打印二叉树
    程序员面试金典--阶乘尾零
    程序员面试金典--矩阵元素查找
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4305511.html
Copyright © 2011-2022 走看看