update

Author: ncduy0303

.vscode/launch.json

@@ -1,9 +1,7 @@
 {
     "files.associations": {
-        "iostream": "cpp",
-        "random": "cpp",
-        "array": "cpp",
         "any": "cpp",
+        "array": "cpp",
         "atomic": "cpp",
         "bit": "cpp",
         "*.tcc": "cpp",
@@ -46,6 +44,7 @@
         "memory_resource": "cpp",
         "numeric": "cpp",
         "optional": "cpp",
+        "random": "cpp",
         "ratio": "cpp",
         "regex": "cpp",
         "string": "cpp",
@@ -59,6 +58,7 @@
         "initializer_list": "cpp",
         "iomanip": "cpp",
         "iosfwd": "cpp",
+        "iostream": "cpp",
         "istream": "cpp",
         "limits": "cpp",
         "mutex": "cpp",
@@ -74,6 +74,5 @@
         "typeinfo": "cpp",
         "valarray": "cpp",
         "variant": "cpp"
-    },
-    "C_Cpp.errorSquiggles": "Disabled"
+    }
 }

.vscode/settings.json

@@ -1,6 +1,6 @@
 {
   "mainSolution": {
-    "value": "/mnt/e/Compeitive Programming/CSES - CSES Problem Set/Apartments/main.cpp"
+    "value": "/mnt/d/CP/CSES - CSES Problem Set/Apartments/main.cpp"
   },
   "bruteSolution": {},
   "generator": {},

.vscode/tasks.json

@@ -1 +1 @@
-219a799e37b81475e5b99072b60828d9
+74b054588b39f6ce03a5a5c046ea308a

Apartments/attic/config.json

@@ -1,53 +1,39 @@
 #include <bits/stdc++.h>
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
 
 using namespace std;
-using namespace __gnu_pbds;
 
-typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
+#define ar array
+#define ll long long
 
-const int MAX_N = 1e5 + 5;
-const int MAX_L = 20; // ~ Log N
-const long long MOD = 1e9 + 7;
-const long long INF = 1e9 + 7;
-const double EPS = 1e-9;
+const int MAX_N = 1e5 + 1;
+const ll MOD = 1e9 + 7;
+const ll INF = 1e9;
 
-typedef long long ll;
-typedef vector<int> vi;
-typedef pair<int,int> ii;
-typedef vector<ii> vii;
-typedef vector<vi> vvi;
 
-#define LSOne(S) (S & (-S))
-#define isBitSet(S, i) ((S >> i) & 1)
 
 void solve() {
     int n, m, k; cin >> n >> m >> k;
-    int a[n], b[m];
-    for (int i = 0; i < n; i++) cin >> a[i];
-    for (int i = 0; i < m; i++) cin >> b[i];
-    sort(a, a + n);
-    sort(b, b + m);
-    
-    int ans = 0, i = 0, j = 0;
-    while (i < n && j < m) {
-        if (b[j] < a[i] - k) j++;
-        else if (b[j] > a[i] + k) i++;
-        else i++, j++, ans++;
+    vector<int> a(n), b(m);
+    for (int &x : a) cin >> x;
+    for (int &x : b) cin >> x;
+    sort(a.begin(), a.end());
+    sort(b.begin(), b.end());
+    int ans = 0;
+    for (int i = 0, j = 0; i < n && j < m;) {
+        if (a[i] + k < b[j]) i++;
+        else if(a[i] - k > b[j]) j++;
+        else ans++, i++, j++;
     }
     cout << ans << "\n";
 }
 
 int main() {
     ios_base::sync_with_stdio(0);
     cin.tie(0); cout.tie(0);
-    //freopen("input.txt", "r", stdin);
-    //freopen("output.txt", "w", stdout);
-
-    int tc; tc = 1;
+    int tc = 1;
+    // cin >> tc;
     for (int t = 1; t <= tc; t++) {
-        //cout << "Case #" << t  << ": ";
+        // cout << "Case #" << t  << ": ";
         solve();
     }
-}
+}

Apartments/attic/main.cpp.md5

@@ -1,6 +1,6 @@
 {
   "mainSolution": {
-    "value": "/mnt/e/Compeitive Programming/CSES - CSES Problem Set/Apple Division/main.cpp"
+    "value": "/mnt/d/CP/CSES - CSES Problem Set/Apple Division/main.cpp"
   },
   "bruteSolution": {},
   "generator": {},

Apartments/attic/sol

@@ -1 +1 @@
-f086919a5aefbd64f4a077c3bf459699
+b3a17e6413a41b1da94c736914e1ab02

Apartments/main

@@ -1,62 +1,39 @@
 #include <bits/stdc++.h>
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
 
 using namespace std;
-using namespace __gnu_pbds;
 
-typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
+#define ar array
+#define ll long long
 
-const int MAX_N = 1e5 + 5;
-const int MAX_L = 20; // ~ Log N
-const long long MOD = 1e9 + 7;
-const long long INF = 1e9 + 7;
-const double EPS = 1e-9;
+const int MAX_N = 1e5 + 1;
+const ll MOD = 1e9 + 7;
+const ll INF = 1e18;
 
-typedef long long ll;
-typedef vector<int> vi;
-typedef pair<int,int> ii;
-typedef vector<ii> vii;
-typedef vector<vi> vvi;
 
-#define LSOne(S) (S & (-S))
-#define isBitSet(S, i) ((S >> i) & 1)
-
-// N is small, so backtracking is possible
-
-int N;
-ll arr[20], ans, total;
-
-void backtrack(int idx = 0, ll sum = 0) {
-    if (idx == N) {
-        ll diff = abs(total - 2 * sum);
-        ans = min(ans , diff);
-        return;
-    }
-    backtrack(idx + 1, sum);
-    backtrack(idx + 1, sum + arr[idx]);
-}
 
 void solve() {
-    cin >> N;
-    for (int i = 0; i < N; i++) {
-        cin >> arr[i];
-        total += arr[i];
+    int n; cin >> n;
+    vector<int> a(n);
+    for (int &x : a) cin >> x;
+    ll ans = INF;
+    for (int mask = 0; mask < (1 << n); mask++) {
+        ll sum1 = 0, sum2 = 0;
+        for (int i = 0; i < n; i++) {
+            if (mask >> i & 1) sum1 += a[i];
+            else sum2 += a[i];
+        }
+        ans = min(ans, abs(sum1 - sum2));
     }
-    ans = total;
-    backtrack();
     cout << ans << "\n";
 }
 
 int main() {
     ios_base::sync_with_stdio(0);
     cin.tie(0); cout.tie(0);
-    //freopen("input.txt", "r", stdin);
-    //freopen("output.txt", "w", stdout);
-
-    int tc; tc = 1;
+    int tc = 1;
+    // cin >> tc;
     for (int t = 1; t <= tc; t++) {
-        //cout << "Case #" << t  << ": ";
+        // cout << "Case #" << t  << ": ";
         solve();
     }
-}
+}

Apartments/main.cpp

@@ -1,6 +1,6 @@
 {
   "mainSolution": {
-    "value": "/mnt/e/Compeitive Programming/CSES - CSES Problem Set/Array Description/main.cpp"
+    "value": "/mnt/d/CP/CSES - CSES Problem Set/Array Description/main.cpp"
   },
   "bruteSolution": {},
   "generator": {},

Apple Division/attic/config.json

@@ -1 +1 @@
-4fb8f129deaf926040080bf81f937bc0
+4667b3e54b829e91b6447bd87a1fc056

Apple Division/attic/main.cpp.md5

@@ -1,60 +1,53 @@
 #include <bits/stdc++.h>
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
 
 using namespace std;
-using namespace __gnu_pbds;
 
-typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
+#define ar array
+#define ll long long
 
-const int MAX_N = 1e5 + 5;
-const int MAX_L = 20; // ~ Log N
-const long long MOD = 1e9 + 7;
-const long long INF = 1e9 + 7;
-const double EPS = 1e-9;
-
-typedef long long ll;
-typedef vector<int> vi;
-typedef pair<int,int> ii;
-typedef vector<ii> vii;
-typedef vector<vi> vvi;
-
-#define LSOne(S) (S & (-S))
-#define isBitSet(S, i) ((S >> i) & 1)
+const int MAX_N = 1e5 + 1;
+const ll MOD = 1e9 + 7;
+const ll INF = 1e9;
 
 
 
 void solve() {
     int n, m; cin >> n >> m;
-    int x[n];
-    for (int i = 0; i < n; i++) cin >> x[i];
-    vvi dp(n, vi(m + 1, 0));
-    for (int i = 1; i <= m; i++)
-        dp[0][i] = (x[0] == 0 || x[0] == i);
+    vector<int> a(n);
+    for (int &x : a) cin >> x;
+    int dp[n][m + 1];
+    memset(dp, 0, sizeof dp);
+    if (a[0] == 0) {
+        for (int i = 1; i <= m; i++) dp[0][i] = 1;
+    } else {
+        dp[0][a[0]] = 1;
+    }
     for (int i = 1; i < n; i++) {
-        for (int j = 1; j <= m; j++) {
-            if (x[i] == 0 || x[i] == j) {
-                dp[i][j] = dp[i - 1][j];
-                if (j > 1) (dp[i][j] += dp[i - 1][j - 1]) %= MOD;
-                if (j < m) (dp[i][j] += dp[i - 1][j + 1]) %= MOD;
+        if (a[i] == 0) {
+            for (int j = 1; j <= m; j++) {
+                dp[i][j] = (dp[i][j] + dp[i - 1][j]) % MOD;
+                if (j > 1) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1]) % MOD;
+                if (j < m) dp[i][j] = (dp[i][j] + dp[i - 1][j + 1]) % MOD;
             }
+        } else {
+            int j = a[i];
+            dp[i][j] = (dp[i][j] + dp[i - 1][j]) % MOD;
+            if (j > 1) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1]) % MOD;
+            if (j < m) dp[i][j] = (dp[i][j] + dp[i - 1][j + 1]) % MOD;
         }
     }
     int ans = 0;
-    for (int i = 1; i <= m; i++) 
-        (ans += dp[n - 1][i]) %= MOD;
+    for (int i = 1; i <= m; i++) ans = (ans + dp[n - 1][i]) % MOD;
     cout << ans << "\n";
 }
 
 int main() {
     ios_base::sync_with_stdio(0);
     cin.tie(0); cout.tie(0);
-    //freopen("input.txt", "r", stdin);
-    //freopen("output.txt", "w", stdout);
-
-    int tc; tc = 1;
+    int tc = 1;
+    // cin >> tc;
     for (int t = 1; t <= tc; t++) {
-        //cout << "Case #" << t  << ": ";
+        // cout << "Case #" << t  << ": ";
         solve();
     }
-}
+}

Apple Division/attic/sol

@@ -1,6 +1,6 @@
 {
   "mainSolution": {
-    "value": "/mnt/e/Compeitive Programming/CSES - CSES Problem Set/Array Division/main.cpp"
+    "value": "/mnt/d/CP/CSES - CSES Problem Set/Array Division/main.cpp"
   },
   "bruteSolution": {},
   "generator": {},