434-effective-approach.cpp

/*
 * Effective Approach  [227B]
 * Problem:  https://codeforces.com/problemset/problem/227/B
 * Verdict:  ACCEPTED        Solved: 2020-12-31
 * Language: C++17 (GCC 7-32)
 * Runtime:  156 ms     Memory: 400 KB
 * Tags:     implementation
 * Author:   BidoTeima
 * Source:   https://codeforces.com/contest/227/submission/102913746
 */

#include <bits/stdc++.h>
using namespace std;
// Important functions and defines
typedef long long ll;
#define f first
#define s second
ll POW(ll expo, ll power) {
    ll res = expo; if (!power) return 1; while (--power) res *= expo; return res;
}
ll sum_range2d(int i, int j, int k, int l, vector<vector<ll>>& s) {
    return s[k][l] - s[k][j - 1] - s[i - 1][l] + s[i - 1][j - 1];
}
ll gcd(ll a, ll b) {
    return (b == 0 ? abs(a) : gcd(b, a % b));
}
bool intersect(pair<int, int> p1, pair<int, int> p2) {
  int x1 = p1.first, x2 = p1.second, y1 = p2.first, y2 = p2.second;
  return (x1 >= y1 && x1 <= y2) ||
         (x2 >= y1 && x2 <= y2) ||
         (y1 >= x1 && y1 <= x2) ||
         (y2 >= x1 && y2 <= x2);
}
// End
int main()
{
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    int n;
    cin>>n;
    int index[n+1];
    for(int i = 1; i <= n; i++) {
        int num;
        cin>>num;
        index[num]=i;
    }
    int q;
    cin>>q;
    ll ans1=0, ans2=0;
    while(q--) {
        int x;
        cin>>x;
        ans1+=index[x], ans2+=n-index[x]+1;
    }
    cout<<ans1<<' '<<ans2;
    return 0;
}