From 6411812a630e4230af27705d11f30405fbd83a68 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 20 Mar 2023 01:21:59 +0200
Subject: Solved 7 problems in Div4

---
 codeforces/WordGame/main             | Bin 0 -> 139080 bytes
 codeforces/WordGame/main.cpp         | 161 +++++++++++++++++++++++++++++++++++
 codeforces/WordGame/main_input0.txt  |  13 +++
 codeforces/WordGame/main_output0.txt |   3 +
 4 files changed, 177 insertions(+)
 create mode 100755 codeforces/WordGame/main
 create mode 100755 codeforces/WordGame/main.cpp
 create mode 100644 codeforces/WordGame/main_input0.txt
 create mode 100644 codeforces/WordGame/main_output0.txt

(limited to 'codeforces/WordGame')

diff --git a/codeforces/WordGame/main b/codeforces/WordGame/main
new file mode 100755
index 0000000..e8c358b
Binary files /dev/null and b/codeforces/WordGame/main differ
diff --git a/codeforces/WordGame/main.cpp b/codeforces/WordGame/main.cpp
new file mode 100755
index 0000000..47effe0
--- /dev/null
+++ b/codeforces/WordGame/main.cpp
@@ -0,0 +1,161 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpi = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back 
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b) - 1) / (b))
+
+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};
+
+template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
+template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
+template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
+template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
+template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
+template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const pair<K, V>& p) {
+  os << "(" << p.first << ", " << p.second << ")";
+  return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const vector<T>& vec) {
+  os << "{";
+  for (size_t i = 0; i < vec.size(); ++i) {
+    if (i > 0) os << ", ";
+    os << vec[i];
+  }
+  os << "}";
+  return os;
+}
+
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const map<K, V>& m) {
+  os << "{";
+  for (const auto& p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
+  os << "{";
+  for (const auto& p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const set<T>& s) {
+  int i = 0;
+  os << "{";
+  for (const auto& e : s) {
+    if (i > 0) os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const unordered_set<T>& s) {
+  int i = 0;
+  os << "{";
+  for (const auto& e : s) {
+    if (i > 0) os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+
+
+/* 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
+ */
+
+void solve() {
+  int n;
+  cin >> n;
+  vector<vector<string>> v(3, vector<string>(n));
+  unordered_map<string, pair<int, vector<int>>> fq;
+  set<string> st;
+  for (int i = 0; i < 3; i++) {
+    for (int j = 0; j < n; j++) {
+      string s;
+      cin >> s;
+      v[i][j] = s;
+      st.insert(s);
+      fq[s].first++;
+      fq[s].second.pb(i);
+    }
+  }
+  vi ans(3);
+  for (auto s : st) {
+    auto x = fq[s];
+    if (x.first == 1) {
+      ans[x.second[0]] += 3;
+    } else if (x.first == 2) {
+      for (auto e : x.second) {
+        ans[e] += 1;
+      }
+    }
+  }
+  for (auto x : ans) {
+    cout << x << " ";
+  }
+  cout << '\n';
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/codeforces/WordGame/main_input0.txt b/codeforces/WordGame/main_input0.txt
new file mode 100644
index 0000000..b10577d
--- /dev/null
+++ b/codeforces/WordGame/main_input0.txt
@@ -0,0 +1,13 @@
+3
+1
+abc
+def
+abc
+3
+orz for qaq
+qaq orz for
+cod for ces
+5
+iat roc hem ica lly
+bac ter iol ogi sts
+bac roc lly iol iat
diff --git a/codeforces/WordGame/main_output0.txt b/codeforces/WordGame/main_output0.txt
new file mode 100644
index 0000000..ccde6af
--- /dev/null
+++ b/codeforces/WordGame/main_output0.txt
@@ -0,0 +1,3 @@
+1 3 1
+2 2 6
+9 11 5
-- 
cgit v1.2.3