Solved 3 problems in the last Div.2

21 files changed, 197 insertions, 54 deletions

diff --git a/contests/Round938/F/main.cpp b/codeforces/PaintingTheRibbon/main.cpp
index 539fdb0..73edcf3 100755
--- a/contests/Round938/F/main.cpp
+++ b/codeforces/PaintingTheRibbon/main.cpp
@@ -41,7 +41,10 @@ const int dy[4]{0, 1, 0, -1};
    * DON'T GET STUCK ON ONE APPROACH
  */
 
-void solve() { <()> }
+void solve() {
+  int n, m, k;
+  cin >> n >> m >> k;
+}
 
 int main() {
   ios_base::sync_with_stdio(false);
diff --git a/codeforces/PaintingTheRibbon/main_input0.txt b/codeforces/PaintingTheRibbon/main_input0.txt
new file mode 100644
index 0000000..11c78ba
--- /dev/null
+++ b/codeforces/PaintingTheRibbon/main_input0.txt
@@ -0,0 +1,6 @@
+5
+1 1 1
+5 1 1
+5 2 1
+5 2 2
+5 5 3
diff --git a/codeforces/PaintingTheRibbon/main_output0.txt b/codeforces/PaintingTheRibbon/main_output0.txt
new file mode 100644
index 0000000..1c6cd63
--- /dev/null
+++ b/codeforces/PaintingTheRibbon/main_output0.txt
@@ -0,0 +1,5 @@
+NO
+NO
+YES
+NO
+YES
diff --git a/contests/Round938/D/main_input0.txt b/contests/Round938/D/main_input0.txt
deleted file mode 100644
index 20a4135..0000000
--- a/contests/Round938/D/main_input0.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 385526b..0000000
--- a/contests/Round938/D/main_output0.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-4
-3
-2
-4
-1
diff --git a/contests/Round938/D/main.cpp b/contests/Round939/A/main.cpp
index 612acb0..4d81036 100755
--- a/contests/Round938/D/main.cpp
+++ b/contests/Round939/A/main.cpp
@@ -19,7 +19,7 @@ using db = long double;
 #define make_unique(x)                                                         \
   sort(all((x)));                                                              \
   (x).resize(unique(all((x))) - (x).begin())
-/* // #define ceil(a, b) ((a) + (b)-1) / (b) */
+#define ceil(a, b) ((a) + (b)-1) / (b)
 
 const int mod = (int)1e9 + 7;
 const db pi = acos((db)-1);
@@ -42,42 +42,25 @@ const int dy[4]{0, 1, 0, -1};
  */
 
 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) {
+  int k, q;
+  cin >> k >> q;
+  vi v(k);
+  vi qs(q);
+  int mn = INT_MAX;
+  for (auto &x : v) {
     cin >> x;
-    mx = max(mx, x);
+    mn = min(mn, x);
   }
-  for (auto &x : b) {
+  for (auto &x : qs) {
     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++;
+  for (int i = 0; i < q; i++) {
+    if (qs[i] < mn) {
+      cout << qs[i] << " \n"[i == q - 1];
+    } else {
+      cout << mn - 1 << " \n"[i == q - 1];
     }
   }
-  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() {
diff --git a/contests/Round939/A/main_input0.txt b/contests/Round939/A/main_input0.txt
new file mode 100644
index 0000000..465bb6a
--- /dev/null
+++ b/contests/Round939/A/main_input0.txt
@@ -0,0 +1,19 @@
+6
+2 1
+3 5
+5
+5 3
+2 4 6 7 9
+1 3 5
+5 4
+3 4 5 6 7
+1 2 3 4
+2 3
+69 96
+1 10 100
+1 1
+100
+50
+3 3
+10 20 30
+1 10 100
diff --git a/contests/Round939/A/main_output0.txt b/contests/Round939/A/main_output0.txt
new file mode 100644
index 0000000..2ab15c1
--- /dev/null
+++ b/contests/Round939/A/main_output0.txt
@@ -0,0 +1,6 @@
+2
+1 1 1
+1 2 2 2
+1 10 68
+50
+1 9 9
diff --git a/contests/Round938/E/main.cpp b/contests/Round939/B/main.cpp
index 539fdb0..ae6b84c 100755
--- a/contests/Round938/E/main.cpp
+++ b/contests/Round939/B/main.cpp
@@ -41,7 +41,21 @@ const int dy[4]{0, 1, 0, -1};
    * DON'T GET STUCK ON ONE APPROACH
  */
 
-void solve() { <()> }
+void solve() {
+  int n;
+  cin >> n;
+  vi v(n);
+  mpii fq;
+  int ans = 0;
+  for (auto &x : v) {
+    cin >> x;
+    fq[x]++;
+    if (fq[x] == 2) {
+      ans++;
+    }
+  }
+  cout << ans << '\n';
+}
 
 int main() {
   ios_base::sync_with_stdio(false);
diff --git a/contests/Round939/B/main_input0.txt b/contests/Round939/B/main_input0.txt
new file mode 100644
index 0000000..b508434
--- /dev/null
+++ b/contests/Round939/B/main_input0.txt
@@ -0,0 +1,11 @@
+5
+4
+1 1 2 3
+8
+7 4 1 2 8 8 5 5
+8
+7 1 4 5 3 4 2 6
+3
+1 2 3
+1
+1
diff --git a/contests/Round939/B/main_output0.txt b/contests/Round939/B/main_output0.txt
new file mode 100644
index 0000000..9a33115
--- /dev/null
+++ b/contests/Round939/B/main_output0.txt
@@ -0,0 +1,5 @@
+1
+2
+1
+0
+0
diff --git a/contests/Round939/C/main.cpp b/contests/Round939/C/main.cpp
new file mode 100755
index 0000000..cc893c7
--- /dev/null
+++ b/contests/Round939/C/main.cpp
@@ -0,0 +1,78 @@
+#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
+ */
+
+// 1 2 3 4
+// 2 2 3 4
+// 3 3 3 4
+// 4 4 4 4
+
+void solve() {
+  int n;
+  cin >> n;
+  ll sum = 0;
+  int j = 1;
+  for (int i = 1; i <= n; i++) {
+    sum += i * j;
+    j += 2;
+  }
+  cout << sum << ' ' << 2 * n << '\n';
+  for (int i = n - 1; i >= 0; i--) {
+    for (int t = 1; t <= 2; t++) {
+      cout << t << ' ' << i + 1;
+      for (int j = 1; j <= n; j++) {
+        cout << ' ' << j;
+      }
+      cout << '\n';
+    }
+  }
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round939/C/main_input0.txt b/contests/Round939/C/main_input0.txt
new file mode 100644
index 0000000..5357a4a
--- /dev/null
+++ b/contests/Round939/C/main_input0.txt
@@ -0,0 +1,3 @@
+2
+1
+2
diff --git a/contests/Round939/C/main_input1.txt b/contests/Round939/C/main_input1.txt
new file mode 100644
index 0000000..c396a2c
--- /dev/null
+++ b/contests/Round939/C/main_input1.txt
@@ -0,0 +1,2 @@
+1
+3
\ No newline at end of file
diff --git a/contests/Round939/C/main_input2.txt b/contests/Round939/C/main_input2.txt
new file mode 100644
index 0000000..b46f59e
--- /dev/null
+++ b/contests/Round939/C/main_input2.txt
@@ -0,0 +1,2 @@
+1
+4
\ No newline at end of file
diff --git a/contests/Round939/C/main_input3.txt b/contests/Round939/C/main_input3.txt
new file mode 100644
index 0000000..5312239
--- /dev/null
+++ b/contests/Round939/C/main_input3.txt
@@ -0,0 +1,2 @@
+1
+5
\ No newline at end of file
diff --git a/contests/Round939/C/main_input4.txt b/contests/Round939/C/main_input4.txt
new file mode 100644
index 0000000..42a2f8b
--- /dev/null
+++ b/contests/Round939/C/main_input4.txt
@@ -0,0 +1,2 @@
+1
+6
\ No newline at end of file
diff --git a/contests/Round939/C/main_input5.txt b/contests/Round939/C/main_input5.txt
new file mode 100644
index 0000000..c8e31a9
--- /dev/null
+++ b/contests/Round939/C/main_input5.txt
@@ -0,0 +1,9 @@
+8
+3
+4
+5
+6
+7
+8
+9
+10
\ No newline at end of file
diff --git a/contests/Round939/C/main_input6.txt b/contests/Round939/C/main_input6.txt
new file mode 100644
index 0000000..852b684
--- /dev/null
+++ b/contests/Round939/C/main_input6.txt
@@ -0,0 +1,2 @@
+1
+50
\ No newline at end of file
diff --git a/contests/Round939/C/main_output0.txt b/contests/Round939/C/main_output0.txt
new file mode 100644
index 0000000..adf90f1
--- /dev/null
+++ b/contests/Round939/C/main_output0.txt
@@ -0,0 +1,6 @@
+1 1
+1 1 1
+7 3
+1 1 1 2
+1 2 1 2
+2 1 1 2
diff --git a/contests/Round939/C/main_output1.txt b/contests/Round939/C/main_output1.txt
new file mode 100644
index 0000000..e9f24e3
--- /dev/null
+++ b/contests/Round939/C/main_output1.txt
@@ -0,0 +1,6 @@
+21 5
+1 1 1 2 3
+1 2 1 2 3
+1 3 1 2 3
+2 1 1 2 3
+2 2 1 2 3
\ No newline at end of file