Add files via upload

Author: MathProgrammer

2022/Contests/Div 2/766/Programs/Not Assigning.cpp

@@ -0,0 +1,101 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <map>
+
+using namespace std;
+
+int other(int p)
+{
+    return (p + 1)%2;
+}
+
+void dfs(vector < vector <int> > &T, int parent_v, int v, map <pair <int, int>, int> &weight, int parity)
+{
+    for(int child_v : T[v])
+    {
+        if(child_v == parent_v)
+        {
+            continue;
+        }
+
+        int x = v, y = child_v;
+        if(x > y)
+        {
+            swap(x, y);
+        }
+
+        weight[make_pair(x, y)] = (parity == 0 ? 2 : 3);
+
+        dfs(T, v, child_v, weight, other(parity));
+    }
+}
+
+void solve()
+{
+    int no_of_vertices;
+    cin >> no_of_vertices;
+
+    int no_of_edges = no_of_vertices - 1;
+    vector <pair <int, int> > edges;
+    vector <vector <int> > tree(no_of_vertices + 1);
+    for(int i = 1; i <= no_of_edges; i++)
+    {
+        int u, v;
+        cin >> u >> v;
+
+        tree[u].push_back(v);
+        tree[v].push_back(u);
+
+        if(u > v)
+        {
+            swap(u, v);
+        }
+
+        edges.push_back(make_pair(u, v));
+    }
+
+    int possible = true;
+    int root = 1;
+    for(int i = 1; i <= no_of_vertices; i++)
+    {
+        if(tree[i].size() >= 3)
+        {
+            possible = false;
+            break;
+        }
+
+        if(tree[i].size() == 1)
+        {
+            root = i;
+        }
+    }
+
+    if(!possible)
+    {
+        cout << "-1\n";
+        return;
+    }
+
+    map <pair <int, int>, int > edge_weight;
+    dfs(tree, 0, root, edge_weight, 0);
+
+    for(pair <int, int> edge : edges)
+    {
+        cout << edge_weight[edge] << " ";
+    }
+    cout << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+
+

2022/Contests/Div 2/766/Programs/Not Shading.cpp

@@ -0,0 +1,72 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+void solve()
+{
+    int rows, columns, x, y;
+    cin >> rows >> columns >> x >> y;
+
+    vector <string> grid(rows);
+    for(int i = 0; i < rows; i++)
+    {
+        cin >> grid[i];
+    }
+    x--;
+    y--;
+
+    int answer = -1;
+
+    int black_count = 0, black_row_count = 0, black_column_count = 0;
+    for(int r = 0; r < rows; r++)
+    {
+        for(int c = 0; c < columns; c++)
+        {
+            if(grid[r][c] == 'B')
+            {
+                black_count++;
+
+                if(r == x)
+                {
+                    black_row_count++;
+                }
+
+                if(c == y)
+                {
+                    black_column_count++;
+                }
+            }
+        }
+    }
+
+    if(grid[x][y] == 'B')
+    {
+        answer = 0;
+    }
+    else if(black_row_count > 0 || black_column_count > 0)
+    {
+        answer = 1;
+    }
+    else if(black_count > 0)
+    {
+        answer = 2;
+    }
+    else
+    {
+        answer = -1;
+    }
+
+    cout << answer << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}

2022/Contests/Div 2/766/Programs/Not Sitting.cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+void solve()
+{
+    int rows, columns;
+    cin >> rows >> columns;
+
+    vector <int> distances;
+    int row_distance = 0, column_distance = 0;
+    for(int r = 1; r <= rows; r++)
+    {
+        for(int c = 1; c <= columns; c++)
+        {
+            row_distance = max(rows - r, r - 1);
+            column_distance = max(columns - c, c - 1);
+            distances.push_back(row_distance + column_distance);
+        }
+
+    }
+
+    sort(distances.begin(), distances.end());
+
+    for(int d : distances)
+    {
+        cout << d << " ";
+    }
+    cout << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+