Linear Keyboard（模拟）：map容器模拟

Linear Keyboard

题面翻译

给定一个字符串 $s$，保证字符串 $s$ 只包含小写字母，现在你要用一个奇怪的键盘来打这一个字符串 $s$。

假设键盘的排列顺序是一条 $s_2$ 的直线。

第一个字母你不需要花费任何时间打字，然后打后面的每一个字母 $s_i$ 花费的时间是 $dist(s_i,s_{i-1})$。

输出最后需要花费的时间。

$dist(a,b)=|a-b|$。

其中字符 $a,b$ 代表在键盘 $s_2$ 中，$a$ 和 $b$ 的位置相隔的距离。

题目描述

You are given a keyboard that consists of $ 26 $ keys. The keys are arranged sequentially in one row in a certain order. Each key corresponds to a unique lowercase Latin letter.

You have to type the word $ s $ on this keyboard. It also consists only of lowercase Latin letters.

To type a word, you need to type all its letters consecutively one by one. To type each letter you must position your hand exactly over the corresponding key and press it.

Moving the hand between the keys takes time which is equal to the absolute value of the difference between positions of these keys (the keys are numbered from left to right). No time is spent on pressing the keys and on placing your hand over the first letter of the word.

For example, consider a keyboard where the letters from ‘a’ to ‘z’ are arranged in consecutive alphabetical order. The letters ‘h’, ‘e’, ‘l’ and ‘o’ then are on the positions $ 8 $ , $ 5 $ , $ 12 $ and $ 15 $ , respectively. Therefore, it will take $ |5 - 8| + |12 - 5| + |12 - 12| + |15 - 12| = 13 $ units of time to type the word “hello”.

Determine how long it will take to print the word $ s $ .

输入格式

The first line contains an integer $ t $ ( $ 1 \leq t \leq 1000 $ ) — the number of test cases.

The next $ 2t $ lines contain descriptions of the test cases.

The first line of a description contains a keyboard — a string of length $ 26 $ , which consists only of lowercase Latin letters. Each of the letters from ‘a’ to ‘z’ appears exactly once on the keyboard.

The second line of the description contains the word $ s $ . The word has a length from $ 1 $ to $ 50 $ letters inclusive and consists of lowercase Latin letters.

输出格式

Print $ t $ lines, each line containing the answer to the corresponding test case. The answer to the test case is the minimal time it takes to type the word $ s $ on the given keyboard.

样例 #1

样例输入 #1

5
abcdefghijklmnopqrstuvwxyz
hello
abcdefghijklmnopqrstuvwxyz
i
abcdefghijklmnopqrstuvwxyz
codeforces
qwertyuiopasdfghjklzxcvbnm
qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq
qwertyuiopasdfghjklzxcvbnm
abacaba

样例输出 #1

13
0
68
0
74

代码

#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>

using namespace std;

string c,b;
map<char,int>a;
int n;

int main(){
    cin>>n;
    
    for(int i=1;i<=n;i++){
        a.clear();
        cin>>c>>b;
        for(int i=0;i<c.size();i++){
            a[c[i]]=i;
        }
        int ans=0;
        for(int i=1;i<b.size();i++){
            ans+=abs(a[b[i]]-a[b[i-1]]);
        }
        
        cout<<ans<<endl;
        
    }
    
    return 0;
}