Solved 4 problems in last Div.3

24 files changed, 546 insertions, 0 deletions

diff --git a/contests/Round938/A/main.cpp b/contests/Round938/A/main.cpp
new file mode 100755
index 0000000..cf881d0
--- /dev/null
+++ b/contests/Round938/A/main.cpp
@@ -0,0 +1,68 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = 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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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, a, b;
+  cin >> n >> a >> b;
+  int ans = 0;
+  if (a * 2 <= b) {
+    ans += a * n;
+  } else {
+    if (n % 2 == 0) {
+      ans += (n / 2) * b;
+    } else {
+      ans += (n / 2) * b + a;
+    }
+  }
+  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/Round938/A/main_input0.txt b/contests/Round938/A/main_input0.txt
new file mode 100644
index 0000000..9db5ef7
--- /dev/null
+++ b/contests/Round938/A/main_input0.txt
@@ -0,0 +1,5 @@
+4
+2 5 9
+3 5 9
+3 5 11
+4 5 11
diff --git a/contests/Round938/A/main_output0.txt b/contests/Round938/A/main_output0.txt
new file mode 100644
index 0000000..79048ee
--- /dev/null
+++ b/contests/Round938/A/main_output0.txt
@@ -0,0 +1,4 @@
+9
+14
+15
+20
diff --git a/contests/Round938/B/main.cpp b/contests/Round938/B/main.cpp
new file mode 100755
index 0000000..d4e8055
--- /dev/null
+++ b/contests/Round938/B/main.cpp
@@ -0,0 +1,85 @@
+#include <algorithm>
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = 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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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
+ */
+
+// 3 9 6
+// 5 7 1
+// 11 4 8
+
+void solve() {
+  int n, c, d;
+  cin >> n >> c >> d;
+  vi v(n * n);
+  for (int i = 0; i < n * n; i++) {
+    cin >> v[i];
+  }
+  int mn = *min_element(all(v));
+  vi mat(n * n);
+  mat[0] = mn;
+  for (int i = 1; i < n * n; i++) {
+    if (i % n == 0) {
+      mat[i] = mat[i - n] + c;
+    } else {
+      mat[i] = mat[i - 1] + d;
+    }
+  }
+  sort(all(mat));
+  sort(all(v));
+  for (int i = 0; i < n * n; i++) {
+    if (v[i] != mat[i]) {
+      cout << "NO\n";
+      return;
+    }
+  }
+  cout << "YES\n";
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round938/B/main_input0.txt b/contests/Round938/B/main_input0.txt
new file mode 100644
index 0000000..376f2ed
--- /dev/null
+++ b/contests/Round938/B/main_input0.txt
@@ -0,0 +1,11 @@
+5
+3 2 3
+3 9 6 5 7 1 10 4 8
+3 2 3
+3 9 6 5 7 1 11 4 8
+2 100 100
+400 300 400 500
+3 2 3
+3 9 6 6 5 1 11 4 8
+4 4 4
+15 27 7 19 23 23 11 15 7 3 19 23 11 15 11 15
diff --git a/contests/Round938/B/main_output0.txt b/contests/Round938/B/main_output0.txt
new file mode 100644
index 0000000..0d0a576
--- /dev/null
+++ b/contests/Round938/B/main_output0.txt
@@ -0,0 +1,5 @@
+NO
+YES
+YES
+NO
+NO
diff --git a/contests/Round938/C/main.cpp b/contests/Round938/C/main.cpp
new file mode 100755
index 0000000..3ce56ff
--- /dev/null
+++ b/contests/Round938/C/main.cpp
@@ -0,0 +1,109 @@
+#include <algorithm>
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = 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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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
+ */
+
+// 11
+// 6 4 2
+
+void solve() {
+  int n;
+  ll k;
+  cin >> n >> k;
+  vi v(n);
+  ll sum = 0;
+  for (auto &x : v) {
+    cin >> x;
+    sum += x;
+  }
+  vi tmp = v;
+  reverse(all(tmp));
+  vll prefix(n + 1);
+  vll suffix(n + 1);
+  prefix[0] = 0;
+  suffix[0] = 0;
+  for (int i = 1; i < n + 1; i++) {
+    prefix[i] = prefix[i - 1] + v[i - 1];
+    suffix[i] = suffix[i - 1] + tmp[i - 1];
+  }
+  if (k >= sum) {
+    cout << n << '\n';
+  } else {
+    int ans = 0;
+    if (k % 2 == 0) {
+      ll first = k / 2;
+      ll last = k / 2;
+      auto it_first = lower_bound(all(prefix), first);
+      auto it_last = lower_bound(all(suffix), last);
+      ans = (it_first - prefix.begin()) + (it_last - suffix.begin());
+      if (*it_first > first) {
+        ans--;
+      }
+      if (*it_last > last) {
+        ans--;
+      }
+    } else {
+      ll first = (k / 2) + 1;
+      ll last = k / 2;
+      auto it_first = lower_bound(all(prefix), first);
+      auto it_last = lower_bound(all(suffix), last);
+      ans = (it_first - prefix.begin()) + (it_last - suffix.begin());
+      if (*it_first > first) {
+        ans--;
+      }
+      if (*it_last > last) {
+        ans--;
+      }
+    }
+    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/Round938/C/main_input0.txt b/contests/Round938/C/main_input0.txt
new file mode 100644
index 0000000..b411a1f
--- /dev/null
+++ b/contests/Round938/C/main_input0.txt
@@ -0,0 +1,13 @@
+6
+4 5
+1 2 4 3
+4 6
+1 2 4 3
+5 20
+2 7 1 8 2
+2 2
+3 2
+2 15
+1 5
+2 7
+5 2
diff --git a/contests/Round938/C/main_input1.txt b/contests/Round938/C/main_input1.txt
new file mode 100644
index 0000000..6c38806
--- /dev/null
+++ b/contests/Round938/C/main_input1.txt
@@ -0,0 +1,3 @@
+1
+5 11
+5 1 2 3 2
\ No newline at end of file
diff --git a/contests/Round938/C/main_input2.txt b/contests/Round938/C/main_input2.txt
new file mode 100644
index 0000000..dd544a9
--- /dev/null
+++ b/contests/Round938/C/main_input2.txt
@@ -0,0 +1,3 @@
+1
+3 5
+1 2 2 1
\ No newline at end of file
diff --git a/contests/Round938/C/main_input3.txt b/contests/Round938/C/main_input3.txt
new file mode 100644
index 0000000..eef0104
--- /dev/null
+++ b/contests/Round938/C/main_input3.txt
@@ -0,0 +1,3 @@
+1
+4 6
+1 3 1 1
\ No newline at end of file
diff --git a/contests/Round938/C/main_input4.txt b/contests/Round938/C/main_input4.txt
new file mode 100644
index 0000000..60c0ced
--- /dev/null
+++ b/contests/Round938/C/main_input4.txt
@@ -0,0 +1,3 @@
+1
+1 1
+1
\ No newline at end of file
diff --git a/contests/Round938/C/main_input5.txt b/contests/Round938/C/main_input5.txt
new file mode 100644
index 0000000..4d01be5
--- /dev/null
+++ b/contests/Round938/C/main_input5.txt
@@ -0,0 +1,3 @@
+1
+2 1
+1 1
\ No newline at end of file
diff --git a/contests/Round938/C/main_output0.txt b/contests/Round938/C/main_output0.txt
new file mode 100644
index 0000000..8a5cc99
--- /dev/null
+++ b/contests/Round938/C/main_output0.txt
@@ -0,0 +1,6 @@
+2
+3
+5
+0
+2
+2
diff --git a/contests/Round938/C/main_output1.txt b/contests/Round938/C/main_output1.txt
new file mode 100644
index 0000000..bf0d87a
--- /dev/null
+++ b/contests/Round938/C/main_output1.txt
@@ -0,0 +1 @@
+4
\ No newline at end of file
diff --git a/contests/Round938/C/main_output2.txt b/contests/Round938/C/main_output2.txt
new file mode 100644
index 0000000..e440e5c
--- /dev/null
+++ b/contests/Round938/C/main_output2.txt
@@ -0,0 +1 @@
+3
\ No newline at end of file
diff --git a/contests/Round938/C/main_output3.txt b/contests/Round938/C/main_output3.txt
new file mode 100644
index 0000000..bf0d87a
--- /dev/null
+++ b/contests/Round938/C/main_output3.txt
@@ -0,0 +1 @@
+4
\ No newline at end of file
diff --git a/contests/Round938/C/main_output4.txt b/contests/Round938/C/main_output4.txt
new file mode 100644
index 0000000..56a6051
--- /dev/null
+++ b/contests/Round938/C/main_output4.txt
@@ -0,0 +1 @@
+1
\ No newline at end of file
diff --git a/contests/Round938/C/main_output5.txt b/contests/Round938/C/main_output5.txt
new file mode 100644
index 0000000..56a6051
--- /dev/null
+++ b/contests/Round938/C/main_output5.txt
@@ -0,0 +1 @@
+1
\ No newline at end of file
diff --git a/contests/Round938/D/main.cpp b/contests/Round938/D/main.cpp
new file mode 100755
index 0000000..612acb0
--- /dev/null
+++ b/contests/Round938/D/main.cpp
@@ -0,0 +1,91 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = 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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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, m, k;
+  cin >> n >> m >> k;
+  mpii fq;
+  vi a(n);
+  vi b(m);
+  int mx = 0;
+  for (auto &x : a) {
+    cin >> x;
+    mx = max(mx, x);
+  }
+  for (auto &x : b) {
+    cin >> x;
+    fq[x]++;
+  }
+  vi v(mx + 1);
+  int ans = 0;
+  int cnt = 0;
+  for (int i = 0; i < m; i++) {
+    v[a[i]]++;
+    if (v[a[i]] && v[a[i]] <= fq[a[i]]) {
+      ans++;
+    }
+  }
+  cnt += ans >= k;
+  for (int i = 1; i < n - m + 1; i++) {
+    v[a[i - 1]]--;
+    if (v[a[i - 1]] < fq[a[i - 1]]) {
+      ans--;
+    }
+    v[a[i + m - 1]]++;
+    if (v[a[i + m - 1]] && v[a[i + m - 1]] <= fq[a[i + m - 1]]) {
+      ans++;
+    }
+    cnt += ans >= k;
+  }
+  cout << cnt << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round938/D/main_input0.txt b/contests/Round938/D/main_input0.txt
new file mode 100644
index 0000000..20a4135
--- /dev/null
+++ b/contests/Round938/D/main_input0.txt
@@ -0,0 +1,16 @@
+5
+7 4 2
+4 1 2 3 4 5 6
+1 2 3 4
+7 4 3
+4 1 2 3 4 5 6
+1 2 3 4
+7 4 4
+4 1 2 3 4 5 6
+1 2 3 4
+11 5 3
+9 9 2 2 10 9 7 6 3 6 3
+6 9 7 8 10
+4 1 1
+4 1 5 6
+6
diff --git a/contests/Round938/D/main_output0.txt b/contests/Round938/D/main_output0.txt
new file mode 100644
index 0000000..385526b
--- /dev/null
+++ b/contests/Round938/D/main_output0.txt
@@ -0,0 +1,5 @@
+4
+3
+2
+4
+1
diff --git a/contests/Round938/E/main.cpp b/contests/Round938/E/main.cpp
new file mode 100755
index 0000000..539fdb0
--- /dev/null
+++ b/contests/Round938/E/main.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = 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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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/Round938/F/main.cpp b/contests/Round938/F/main.cpp
new file mode 100755
index 0000000..539fdb0
--- /dev/null
+++ b/contests/Round938/F/main.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = 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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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();
+  }
+}