Add files via upload

Author: MathProgrammer

2023/Contests/Div 2/857/Programs/Likes.cpp

@@ -0,0 +1,74 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+void solve()
+{
+    int no_of_elements;
+    cin >> no_of_elements;
+
+    vector <int> A(no_of_elements + 1);
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        cin >> A[i];
+    }
+
+    int likes = 0, unlikes = 0;
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        likes += (A[i] > 0);
+        unlikes += (A[i] < 0);
+    }
+
+    vector <int> maximum_likes(no_of_elements + 1);
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        if(i <= likes)
+        {
+            maximum_likes[i] = maximum_likes[i - 1] + 1;
+        }
+        else
+        {
+            maximum_likes[i] = maximum_likes[i - 1] - 1;
+        }
+    }
+
+    vector <int> minimum_likes(no_of_elements + 1);
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        if( (i + 1)/2 <= unlikes )
+        {
+            minimum_likes[i] = 1;
+            minimum_likes[i + 1] = 0;
+            i = i + 1;
+        }
+        else
+        {
+            minimum_likes[i] = minimum_likes[i - 1] + 1;
+        }
+    }
+
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        cout << maximum_likes[i] << " ";
+    }
+    cout << "\n";
+
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        cout << minimum_likes[i] << " ";
+    }
+    cout << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}

2023/Contests/Div 2/857/Programs/Settlement of Guinea Pigs.cpp

@@ -0,0 +1,72 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+void solve()
+{
+    int no_of_days;
+    cin >> no_of_days;
+
+    vector <int> event(no_of_days + 1);
+    for(int i = 1; i <= no_of_days; i++)
+    {
+        cin >> event[i];
+    }
+
+    const int ADOPT = 1, DOCTOR = 2;
+    int bought_avaries = 0, half_avaries = 0, free_avaries = 0;
+    for(int i = 1; i <= no_of_days; i++)
+    {
+        switch(event[i])
+        {
+            case ADOPT :
+            {
+                if(free_avaries > 0)
+                {
+                    free_avaries--;
+                }
+                else
+                {
+                    bought_avaries++;
+                }
+
+                half_avaries++;
+
+                break;
+            }
+
+            case DOCTOR :
+            {
+                int pairs = 0;
+                if(half_avaries%2 == 0)
+                {
+                    pairs = (half_avaries - 2)/2;
+
+                }
+                else
+                {
+                    pairs = (half_avaries - 1)/2;
+                }
+
+                free_avaries += pairs;
+                half_avaries -= 2*pairs;
+                break;
+            }
+        }
+    }
+
+    cout << bought_avaries << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+

2023/Contests/Div 2/857/Programs/The Very Beautiful Blanket.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+#include <set>
+
+using namespace std;
+
+void solve()
+{
+    int rows, columns;
+    cin >> rows >> columns;
+
+    vector <vector <long long> > M(rows + 1, vector <long long> (columns + 1));
+    for(int i = 1, cell_no = 0; i <= rows; i++)
+    {
+        M[i][1] = cell_no++;
+        M[i][2] = cell_no++;
+    }
+
+    for(int i = 1; i <= rows; i++)
+    {
+        for(int j = 3; j <= columns; j++)
+        {
+            long long offset = (j << 9);
+            int reference_column = (j%2 == 1 ? 1 : 2);
+
+            M[i][j] = M[i][reference_column]^offset;
+            M[i][j] = M[i][reference_column]^offset;
+        }
+    }
+
+    cout << rows*columns << "\n";
+    for(int i = 1; i <= rows; i++)
+    {
+        for(int j = 1; j <= columns; j++)
+        {
+            cout << M[i][j] << " ";
+        }
+
+        cout << "\n";
+    }
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+
+