Solved a bunch of problems

20 files changed, 677 insertions, 0 deletions

diff --git a/contests/Round#855(Div3)/A/main b/contests/Round#855(Div3)/A/main
new file mode 100755
index 0000000..7f17c3a
--- /dev/null
+++ b/contests/Round#855(Div3)/A/main
diff --git a/contests/Round#855(Div3)/A/main.cpp b/contests/Round#855(Div3)/A/main.cpp
new file mode 100755
index 0000000..11e6cd2
--- /dev/null
+++ b/contests/Round#855(Div3)/A/main.cpp
@@ -0,0 +1,101 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+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;
+  string s;
+  cin >> s;
+  for (int i = 0; i < s.length(); i++) {
+    s[i] = tolower(s[i]);
+  }
+  if (regex_match(s, regex("^m+e+o+w+$"))) {
+    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();
+  }
+}
+
+
diff --git a/contests/Round#855(Div3)/A/main_input0.txt b/contests/Round#855(Div3)/A/main_input0.txt
new file mode 100644
index 0000000..3a194d3
--- /dev/null
+++ b/contests/Round#855(Div3)/A/main_input0.txt
@@ -0,0 +1,15 @@
+7
+4
+meOw
+14
+mMmeoOoWWWwwwW
+3
+mew
+7
+MmeEeUw
+4
+MEOW
+6
+MmyaVW
+5
+meowA
diff --git a/contests/Round#855(Div3)/A/main_output0.txt b/contests/Round#855(Div3)/A/main_output0.txt
new file mode 100644
index 0000000..222b3f9
--- /dev/null
+++ b/contests/Round#855(Div3)/A/main_output0.txt
@@ -0,0 +1,7 @@
+YES
+YES
+NO
+NO
+YES
+NO
+NO
diff --git a/contests/Round#855(Div3)/B/main b/contests/Round#855(Div3)/B/main
new file mode 100755
index 0000000..1fcd57c
--- /dev/null
+++ b/contests/Round#855(Div3)/B/main
diff --git a/contests/Round#855(Div3)/B/main.cpp b/contests/Round#855(Div3)/B/main.cpp
new file mode 100755
index 0000000..5ef8ae8
--- /dev/null
+++ b/contests/Round#855(Div3)/B/main.cpp
@@ -0,0 +1,113 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+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, k;
+  string s;
+  cin >> n >> k;
+  cin >> s;
+  map<char, int> fq;
+  for (auto ch : s) {
+    fq[ch]++;
+  }
+  int ans = 0;
+  for (int i = 0; i < 26; i++) {
+    ans += min(fq['a' + i], fq['A' + i]);
+  }
+  for (int i = 0; i < 26; i++) {
+    int mx = max(fq['a' + i], fq['A' + i]);
+    int mn = min(fq['a' + i], fq['A' + i]);
+    int xn = (mx - mn) / 2;
+    if (k > 0) {
+      ans += (mx - mn) / 2;
+      k -= (mx - mn) / 2;;
+    } else {
+      break;
+    }
+  }
+  cout << ans + (k < 0 ? k : 0) << '\n';
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Round#855(Div3)/B/main_input0.txt b/contests/Round#855(Div3)/B/main_input0.txt
new file mode 100644
index 0000000..5edeb84
--- /dev/null
+++ b/contests/Round#855(Div3)/B/main_input0.txt
@@ -0,0 +1,11 @@
+5
+11 2
+aAaaBACacbE
+2 2
+ab
+4 1
+aaBB
+6 0
+abBAcC
+5 3
+cbccb
diff --git a/contests/Round#855(Div3)/B/main_input1.txt b/contests/Round#855(Div3)/B/main_input1.txt
new file mode 100644
index 0000000..567b03b
--- /dev/null
+++ b/contests/Round#855(Div3)/B/main_input1.txt
@@ -0,0 +1,3 @@
+1
+6 2
+aaaaaa
\ No newline at end of file
diff --git a/contests/Round#855(Div3)/B/main_output0.txt b/contests/Round#855(Div3)/B/main_output0.txt
new file mode 100644
index 0000000..bf5057a
--- /dev/null
+++ b/contests/Round#855(Div3)/B/main_output0.txt
@@ -0,0 +1,5 @@
+5
+0
+1
+3
+2
diff --git a/contests/Round#855(Div3)/B/main_output1.txt b/contests/Round#855(Div3)/B/main_output1.txt
new file mode 100644
index 0000000..d8263ee
--- /dev/null
+++ b/contests/Round#855(Div3)/B/main_output1.txt
@@ -0,0 +1 @@
+2
\ No newline at end of file
diff --git a/contests/Round#855(Div3)/C/main b/contests/Round#855(Div3)/C/main
new file mode 100755
index 0000000..5bfd3ac
--- /dev/null
+++ b/contests/Round#855(Div3)/C/main
diff --git a/contests/Round#855(Div3)/C/main.cpp b/contests/Round#855(Div3)/C/main.cpp
new file mode 100755
index 0000000..dda4a51
--- /dev/null
+++ b/contests/Round#855(Div3)/C/main.cpp
@@ -0,0 +1,107 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+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 v(n);
+  ll ans = 0;
+  priority_queue<int> pq;
+  for (int i = 0; i < n; i++) {
+    int x;
+    cin >> x;
+    if (x > 0) {
+      pq.push(x);
+    }
+    v[i] = x;
+    if (x == 0 && pq.size()) {
+      ans += pq.top();
+      pq.pop();
+    }
+  }
+  cout << ans << '\n';
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Round#855(Div3)/C/main_input0.txt b/contests/Round#855(Div3)/C/main_input0.txt
new file mode 100644
index 0000000..d850bc4
--- /dev/null
+++ b/contests/Round#855(Div3)/C/main_input0.txt
@@ -0,0 +1,11 @@
+5
+5
+3 3 3 0 0
+6
+0 3 3 0 0 3
+7
+1 2 3 0 4 5 0
+7
+1 2 5 0 4 3 0
+5
+3 1 0 0 4
diff --git a/contests/Round#855(Div3)/C/main_output0.txt b/contests/Round#855(Div3)/C/main_output0.txt
new file mode 100644
index 0000000..26aa2ea
--- /dev/null
+++ b/contests/Round#855(Div3)/C/main_output0.txt
@@ -0,0 +1,5 @@
+6
+6
+8
+9
+4
diff --git a/contests/Round#855(Div3)/D/main b/contests/Round#855(Div3)/D/main
new file mode 100755
index 0000000..4a29efb
--- /dev/null
+++ b/contests/Round#855(Div3)/D/main
diff --git a/contests/Round#855(Div3)/D/main.cpp b/contests/Round#855(Div3)/D/main.cpp
new file mode 100755
index 0000000..ee23437
--- /dev/null
+++ b/contests/Round#855(Div3)/D/main.cpp
@@ -0,0 +1,98 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+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;
+  string s;
+  cin >> s;
+  int ans = 1;
+  for (int i = 2; i < n; i++) {
+    ans += s[i] != s[i - 2];
+  }
+  cout << ans << '\n';
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Round#855(Div3)/D/main_input0.txt b/contests/Round#855(Div3)/D/main_input0.txt
new file mode 100644
index 0000000..cd6670e
--- /dev/null
+++ b/contests/Round#855(Div3)/D/main_input0.txt
@@ -0,0 +1,15 @@
+7
+6
+aaabcc
+10
+aaaaaaaaaa
+6
+abcdef
+7
+abacaba
+6
+cccfff
+4
+abba
+5
+ababa
diff --git a/contests/Round#855(Div3)/D/main_output0.txt b/contests/Round#855(Div3)/D/main_output0.txt
new file mode 100644
index 0000000..78452a0
--- /dev/null
+++ b/contests/Round#855(Div3)/D/main_output0.txt
@@ -0,0 +1,7 @@
+4
+1
+5
+3
+3
+3
+1
diff --git a/contests/Round#855(Div3)/E/main.cpp b/contests/Round#855(Div3)/E/main.cpp
new file mode 100755
index 0000000..7590c13
--- /dev/null
+++ b/contests/Round#855(Div3)/E/main.cpp
@@ -0,0 +1,89 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+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 main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Round#855(Div3)/F/main.cpp b/contests/Round#855(Div3)/F/main.cpp
new file mode 100755
index 0000000..7590c13
--- /dev/null
+++ b/contests/Round#855(Div3)/F/main.cpp
@@ -0,0 +1,89 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+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 main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+