aboutsummaryrefslogtreecommitdiff
path: root/contests/Round938/D
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2024-04-13 16:15:35 +0200
committeromagdy7 <omar.professional8777@gmail.com>2024-04-13 16:15:35 +0200
commitff7585043c5f48cf94bc7ace4ad1b8fe9b4df9ef (patch)
treea68943fe77475c70f39170b5e6ee199405b7f5b1 /contests/Round938/D
parentc1bbcb6c2a6d02a4ac06d3c41afcfc51993ec1d3 (diff)
downloadcompetitive-programming-ff7585043c5f48cf94bc7ace4ad1b8fe9b4df9ef.tar.xz
competitive-programming-ff7585043c5f48cf94bc7ace4ad1b8fe9b4df9ef.zip
Solved 4 problems in last Div.3
Diffstat (limited to 'contests/Round938/D')
-rwxr-xr-xcontests/Round938/D/main.cpp91
-rw-r--r--contests/Round938/D/main_input0.txt16
-rw-r--r--contests/Round938/D/main_output0.txt5
3 files changed, 112 insertions, 0 deletions
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