From ba391960d9d26180335fccc2f3d593021324de76 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Sun, 19 Mar 2023 11:58:33 +0200
Subject: Solved new problems from codeforces

---
 codeforces/NonAlternatingDeckHard/main.cpp | 162 +++++++++++++++++++++++++++++
 1 file changed, 162 insertions(+)
 create mode 100755 codeforces/NonAlternatingDeckHard/main.cpp

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

diff --git a/codeforces/NonAlternatingDeckHard/main.cpp b/codeforces/NonAlternatingDeckHard/main.cpp
new file mode 100755
index 0000000..29a71f5
--- /dev/null
+++ b/codeforces/NonAlternatingDeckHard/main.cpp
@@ -0,0 +1,162 @@
+#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 pfx(n); //no of black tiles;
+  pfx[0] = 0;
+  int w1 = 1, w2 = 0, b1 = 0, b2 = 0;
+  for (int i = 1; i < n; i++) {
+    pfx[i] = pfx[i - 1] + (i % 2 != 0);
+  }
+  int i = 5;
+  int j = 1;
+  int cnt = 0;
+  ll sum = 0;
+  while (sum < n) {
+    sum = w1 + w2 + b1 + b2;
+    if (cnt % 2 == 0) {
+      int r = min(i + j - 1, n - 1);
+      int pf = pfx[r] - pfx[j - 1];
+      b2 += pf;
+      w2 += (r + 1 - j) - pf;
+    } else {
+      int r = min(i + j - 1, n - 1);
+      int pf = pfx[min(i + j - 1, n - 1)] - pfx[j - 1];
+      b1 += pf;
+      w1 += (r + 1 - j) - pf;
+    }
+    cnt++;
+    j = min(i + j - 1, n - 1) + 1;
+    i += 4;
+  }
+  cout << w1 << " " << b1 << " " << w2 << " " << b2 << '\n';
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
-- 
cgit v1.2.3