From 60214bc8d0cfa68c1e3b74b62d9dcd1f548390eb Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Sun, 24 Sep 2023 21:04:29 +0300
Subject: Solved 5 problem in the last Div.4

---
 contests/Round898/F/main.cpp | 165 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 165 insertions(+)
 create mode 100755 contests/Round898/F/main.cpp

(limited to 'contests/Round898/F/main.cpp')

diff --git a/contests/Round898/F/main.cpp b/contests/Round898/F/main.cpp
new file mode 100755
index 0000000..87704f4
--- /dev/null
+++ b/contests/Round898/F/main.cpp
@@ -0,0 +1,165 @@
+#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 dbg() { cerr << "\n"; }
+
+template <typename T, typename... TS> void dbg(T val, TS... vals) {
+  cerr << val << " ";
+  dbg(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
+ */
+
+// ABAB
+void solve() {
+  int n, k;
+  cin >> n >> k;
+  vi v(n), h(n);
+  vll pfx(n + 1, 0);
+  for (auto &x : v) {
+    cin >> x;
+  }
+  for (auto &x : h) {
+    cin >> x;
+  }
+  for (int i = 0; i < n; i++) {
+    pfx[i + 1] = pfx[i] + v[i];
+  }
+  int start = 0;
+  ll ans = 0;
+  for (int i = 0; i < n; i++) {
+    while (i < n - 1 && h[i] % h[i + 1] == 0) {
+      i++;
+    }
+    for (int j = start; j <= i; j++) {
+      ll lo = j - 1, hi = i + 1;
+      while (hi - lo > 1) {
+        ll mid = (hi + lo) / 2;
+        if (pfx[mid + 1] - pfx[j] > k) {
+          hi = mid;
+        } else {
+          lo = mid;
+        }
+      }
+      ans = max(ans, hi - j);
+    }
+    start = i + 1;
+  }
+  cout << ans << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
-- 
cgit v1.2.3