From 89733653d2f6a9cfe4a4d89f6f90fcb8f30bc14e Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 14 Nov 2022 23:47:04 +0200
Subject: Added 3 new problems from codeforces

---
 codeforces/EffectiveApproach/main.cpp | 58 +++++++++++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 codeforces/EffectiveApproach/main.cpp

(limited to 'codeforces/EffectiveApproach/main.cpp')

diff --git a/codeforces/EffectiveApproach/main.cpp b/codeforces/EffectiveApproach/main.cpp
new file mode 100644
index 0000000..8c7c602
--- /dev/null
+++ b/codeforces/EffectiveApproach/main.cpp
@@ -0,0 +1,58 @@
+#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() {
+  int n, m;
+  cin >> n;
+  vi v(n);
+  mpii mp;
+  for (int i = 0; i < n; i++) {
+    cin >> v[i];
+    mp[v[i]] = i;
+  }
+  cin >> m;
+  vi q(m);
+  for (auto &x : q) cin >> x;
+  ll ans1 = 0, ans2 = 0;
+  for (auto x : q) {
+    ans1 += mp[x] + 1;
+    ans2 += n - mp[x];
+  }
+  cout << ans1 << " " << ans2 << '\n';
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+  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
+ */
-- 
cgit v1.2.3