From 4529466e757ee26063bcf943a22223d12ad6a792 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 27 Mar 2023 21:01:38 +0200
Subject: Solved A and B in round 860

---
 contests/Round860/A/main.cpp | 170 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 170 insertions(+)
 create mode 100755 contests/Round860/A/main.cpp

(limited to 'contests/Round860/A/main.cpp')

diff --git a/contests/Round860/A/main.cpp b/contests/Round860/A/main.cpp
new file mode 100755
index 0000000..1ec5590
--- /dev/null
+++ b/contests/Round860/A/main.cpp
@@ -0,0 +1,170 @@
+#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;
+  vi a(n);
+  vi b(n);
+  int mxa = 0;
+  int mxb = 0;
+  for (int i = 0; i < n; ++i) {
+    cin >> a[i];
+    mxa = max(mxa, a[i]);
+  }
+  for (int i = 0; i < n; ++i) {
+    cin >> b[i];
+    mxb = max(mxb, b[i]);
+  }
+  vi da = a;
+  vi db = b;
+  for (int i = 0; i < n; i++) {
+    if (da[i] > da[n - 1] && db[i] <= da[n - 1]) {
+      int tmp = da[i];
+      da[i] = db[i];
+      db[i] = tmp;
+    }
+  }
+  vi aa = a;
+  vi bb = b;
+  swap(aa[n - 1], bb[n - 1]);
+  for (int i = 0; i < n; i++) {
+    if (aa[i] > aa[n - 1] && bb[i] <= aa[n - 1]) {
+      int tmp = aa[i];
+      aa[i] = bb[i];
+      bb[i] = tmp;
+    }
+  }
+  if ((da[n - 1] == *max_element(all(da)) && db[n - 1] == *max_element(all(db))) || (aa[n - 1] == *max_element(all(aa)) && bb[n - 1] == *max_element(all(bb)))) {
+    cout << "Yes\n";
+  } else {
+    cout << "No\n";
+  }
+  
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
-- 
cgit v1.2.3