add gym solutions

Author: muhammadalmuzahid

OnlineJudgeSoutions/CodeforcesGym/2024 Argentinian Programming Tournament (TAP)/F_Fixture.cpp

@@ -0,0 +1,43 @@
+#include <bits/stdc++.h>
+#define debug(x) cout << #x << " = "; cout << x << '\n';
+using namespace std;
+typedef long long ll;
+const int ARRAY_SIZE  = (int) 2e6+3;
+
+void idea() {
+    int n;
+    cin >> n;
+    vector <int> a(n);
+    int ans = 0;
+    for(int &in : a) {
+        cin >> in;
+        if(in == 0){
+            ans--;
+        }
+        else {
+            ans++;
+        }
+    }
+    if(n >= 3){
+        if(a[0] == 1 and a[1] == 1 and a[2] == 1){
+            ++ans;
+        }
+        for(int i = 3; i < n; i++) {
+            if(a[i - 2] == 1 and a[i - 1] == 1 and a[i] == 1) {
+                ++ans;
+            }
+        }
+    }
+    cout << ans << '\n';
+}
+
+int main() {
+    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+    int T = 1;
+    // cin >> T;
+    for(int C = 1; C <= T; C++) {
+        // cout << "Case " << C << ": " << '\n';
+        idea();
+    }
+    return 0;
+}

OnlineJudgeSoutions/CodeforcesGym/2024 Argentinian Programming Tournament (TAP)/J_Never_Add_Up_to_X.cpp

@@ -0,0 +1,67 @@
+#include <bits/stdc++.h>
+#define debug(x) cout << #x << " = "; cout << x << '\n';
+using namespace std;
+typedef long long ll;
+const int ARRAY_SIZE  = (int) 2e6+3;
+
+void idea() {
+    int n, x;
+    cin >> n >> x;
+    vector<int> ar(n);
+    
+    for (int i = 0; i < n; i++)
+        cin >> ar[i];
+    
+    // Sort the array of beauties
+    sort(ar.begin(), ar.end());
+
+    int l = 0;     // leftmost pointer
+    int r = n - 1; // rightmost pointer
+    bool f = true; // flag to check if a valid arrangement exists
+
+    for (int i = 1; i < n; i++) {
+        if (!f) break;
+        if (ar[i] + ar[i - 1] == x) {
+            if (ar[i - 1] != ar[l]) {
+                swap(ar[l], ar[i - 1]);
+                l += 2;
+            }
+            else if (ar[i] != ar[r]) {
+                swap(ar[r], ar[i]);
+                r -= 2;
+            }
+            else {
+                f = false;
+            }
+        }
+    }
+
+    f = true;
+    // Second check to ensure no two adjacent elements sum to x
+    for (int i = 1; i < n; i++) {
+        if (ar[i] + ar[i - 1] == x) {
+            f = false;
+            break;
+        }
+    }
+
+    // Output the result
+    if (f) {
+        for (int i = 0; i < n; i++)
+            cout << ar[i] << " ";
+        cout << '\n';
+    } else {
+        cout << "*" << '\n';
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+    int T = 1;
+    // cin >> T;
+    for(int C = 1; C <= T; C++) {
+        // cout << "Case " << C << ": " << '\n';
+        idea();
+    }
+    return 0;
+}

OnlineJudgeSoutions/CodeforcesGym/2024 Argentinian Programming Tournament (TAP)/L_Games.cpp

@@ -0,0 +1,67 @@
+#include <bits/stdc++.h>
+#define debug(x) cout << #x << " = "; cout << x << '\n';
+using namespace std;
+typedef long long ll;
+const int ARRAY_SIZE  = (int) 2e6+3;
+
+void idea() {
+    int n, q;
+    cin >> n >> q;
+    vector <int> a(n + 1, 0);
+    for(int i = 1; i <= n; i++){
+        cin >> a[i];
+    }
+    vector <int> alice(n + 1, 0), bob(n + 1, 0), count_one(n + 1, 0);
+
+    for(int i = 1; i <= n; i++){
+        int x = a[i];
+        if((x & (~(x - 1))) == x){
+            alice[i] += x;
+        }
+        if(x & 1){
+            bob[i] += x;
+        }
+        if(x == 1){
+            count_one[i] += x;
+        }
+        alice[i] += alice[i - 1];
+        bob[i] += bob[i - 1];
+        count_one[i] += count_one[i - 1];
+    }
+
+    while(q--){
+        int L, R;
+        cin >> L >> R;
+
+        ll A = alice[R] - alice[L- 1];
+        ll B = bob[R] - bob[L - 1];
+        ll one = count_one[R] - count_one[L - 1];
+
+        A -= one;
+        B -= one;
+
+        if(one & 1ll){
+            A += (one + 1) / 2;
+            B += (one / 2);
+        }
+        else{
+            A += (one / 2);
+            B += (one / 2);
+        }
+
+        if(A > B) cout << 'A' << '\n';
+        else if(B > A)  cout << 'B' << '\n';
+        else cout << 'E' << '\n';
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+    int T = 1;
+    // cin >> T;
+    for(int C = 1; C <= T; C++) {
+        // cout << "Case " << C << ": " << '\n';
+        idea();
+    }
+    return 0;
+}

OnlineJudgeSoutions/CodeforcesGym/2024 Argentinian Programming Tournament (TAP)/N_New_Dimensions.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h>
+#define debug(x) cout << #x << " = "; cout << x << '\n';
+using namespace std;
+typedef long long ll;
+const int ARRAY_SIZE  = (int) 2e6+3;
+
+void idea() {
+    ll n;
+    cin >> n;
+    vector <ll> a(n);
+    for(ll &in : a) cin >> in;
+    if(n == 1){
+        cout << 0 << '\n';
+        return;
+    }
+    
+    sort(a.rbegin(), a.rend());
+
+    ll x = a[0], y, z;
+    ll profit = 0;
+    for(ll ii = 0; ii < n; ii++){
+        y = a[ii];
+        for(ll jj = 0; jj < n; jj++) {
+            z = a[jj];
+            ll sell = x * x + y * y + z * z;
+            ll buy = x * y + y * x + z * x;
+            profit = max(profit, sell - buy);
+        }
+    }
+    cout << profit << '\n';
+}
+
+int main() {
+    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+    int T = 1;
+    // cin >> T;
+    for(int C = 1; C <= T; C++) {
+        // cout << "Case " << C << ": " << '\n';
+        idea();
+    }
+    return 0;
+}