-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCopia de Effective_approach.cpp
More file actions
50 lines (43 loc) · 1.04 KB
/
Copia de Effective_approach.cpp
File metadata and controls
50 lines (43 loc) · 1.04 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <iostream>
#include <vector>
#include<map>
using namespace std;
int main() {
long long int n1;
cin >> n1;
long long int apoyo1;
apoyo1 = n1;
vector<long long int> v1;
while(n1--){
long long int x;
cin >> x;
v1.push_back(x);
}
long long int n2;
cin >> n2;
long long int apoyo2;
apoyo2 = n2;
vector<long long int> v2;
while(n2--){
long long int x2;
cin >> x2;
v2.push_back(x2);
}
long long int contador = 0;
long long int contador2 = 0;
map< long long int, long long int> mapa;
for(long long int i = 0; i < apoyo1; i++){
mapa[v1[i]] = i;
}
for(long long int i = 0; i < apoyo2; i++){
long long int nalas = 0;
nalas = mapa[v2[i]] + 1;
contador = contador + nalas;
}
for(long long int i = 0; i < apoyo2; i++){
long long int nalas2 = 0;
nalas2 = apoyo1 - mapa[v2[i]];
contador2 = contador2 + nalas2;
}
cout << contador << ' ' << contador2 << endl;
}