From 47cb41f721c44a3e89cf09218c59a64e0b703994 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 31 Jul 2023 17:55:28 +0300
Subject: Solve 3 problems from div3

---
 codeforces/LongLong/main             | Bin 0 -> 19928 bytes
 codeforces/LongLong/main.cpp         | 148 +++++++++++++++++++++++++++++++++++
 codeforces/LongLong/main_input0.txt  |  11 +++
 codeforces/LongLong/main_output0.txt |   5 ++
 4 files changed, 164 insertions(+)
 create mode 100755 codeforces/LongLong/main
 create mode 100755 codeforces/LongLong/main.cpp
 create mode 100644 codeforces/LongLong/main_input0.txt
 create mode 100644 codeforces/LongLong/main_output0.txt

(limited to 'codeforces/LongLong')

diff --git a/codeforces/LongLong/main b/codeforces/LongLong/main
new file mode 100755
index 0000000..79216e9
Binary files /dev/null and b/codeforces/LongLong/main differ
diff --git a/codeforces/LongLong/main.cpp b/codeforces/LongLong/main.cpp
new file mode 100755
index 0000000..2cb7fab
--- /dev/null
+++ b/codeforces/LongLong/main.cpp
@@ -0,0 +1,148 @@
+#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
+ */
+
+void solve() {
+  int n;
+  cin >> n;
+  vll v(n);
+  ll sum = 0;
+  for (int i = 0; i < n; i++) {
+    cin >> v[i];
+    sum += abs(v[i]);
+  }
+  int ops = 0;
+  for (int i = 0; i < n; i++) {
+    if (v[i] < 0) {
+      ops++;
+      while (i < n && v[i] <= 0) {
+        i++;
+      }
+    }
+  }
+  cout << sum << ' ' << ops << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/LongLong/main_input0.txt b/codeforces/LongLong/main_input0.txt
new file mode 100644
index 0000000..18e1a67
--- /dev/null
+++ b/codeforces/LongLong/main_input0.txt
@@ -0,0 +1,11 @@
+5
+6
+-1 7 -4 -2 5 -8
+8
+-1 0 0 -2 1 0 -3 0
+5
+2 -1 0 -3 -7
+5
+0 -17 0 1 0
+4
+-1 0 -2 -1
diff --git a/codeforces/LongLong/main_output0.txt b/codeforces/LongLong/main_output0.txt
new file mode 100644
index 0000000..d3c1448
--- /dev/null
+++ b/codeforces/LongLong/main_output0.txt
@@ -0,0 +1,5 @@
+27 3
+7 2
+13 1
+18 1
+4 1
-- 
cgit v1.2.3