diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-14 23:48:43 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-14 23:48:43 +0200 |
| commit | 66d5d77247012cbcd65ef6e8294bdb042198a5c2 (patch) | |
| tree | 28561a94cf4d27e43c9fe5a359dc25d023d43b7c /codeforces/LinearKeyboard/main.cpp | |
| parent | 89733653d2f6a9cfe4a4d89f6f90fcb8f30bc14e (diff) | |
| download | competitive-programming-66d5d77247012cbcd65ef6e8294bdb042198a5c2.tar.xz competitive-programming-66d5d77247012cbcd65ef6e8294bdb042198a5c2.zip | |
Moved two files into codeforces directory
Diffstat (limited to 'codeforces/LinearKeyboard/main.cpp')
| -rw-r--r-- | codeforces/LinearKeyboard/main.cpp | 60 |
1 files changed, 60 insertions, 0 deletions
diff --git a/codeforces/LinearKeyboard/main.cpp b/codeforces/LinearKeyboard/main.cpp new file mode 100644 index 0000000..96ac0d4 --- /dev/null +++ b/codeforces/LinearKeyboard/main.cpp @@ -0,0 +1,60 @@ +#include<bits/stdc++.h> + +using namespace std; + +using ll = long long; +using pi = pair<int, int>; +using vpi = vector<pi>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define push_back pb +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +void solve() { + string alphabet, word; + cin >> alphabet; + cin >> word; + map<char, int> mp; + int ans = 0; + for (int i = 0; i < alphabet.size(); i++) { + mp[alphabet[i]] = i + 1; + } + for (auto [key, val] : mp) { + cerr << (char)key << " : " << val << '\n'; + } + for (int i = 1; i < word.size(); i++) { + ans += abs(mp[word[i]] - mp[word[i - 1]]); + } + cout << ans << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ |
