Merge branch 'master' into master

Author: KejariwalAyush

CONTRIBUTORS.md

@@ -116,5 +116,6 @@ These are the list of contributors to this project **who have completed 5 proble
 
 > <img src="https://avatars0.githubusercontent.com/u/53379005?s=400&u=a852e463c8cbae7653bf7651c0844b384ab7a7d8&v=4" width="50"> [Utkarsh Shankar](https://github.com/UtkarshShankar)
 
-> <img src="https://avatars1.githubusercontent.com/u/53162729?s=400&u=16783675e602b7de353919c32357c7e12bc69ee3&v=4" width="50"> [Sahil Agarwal](https://github.com/agarwalsahil0210)
+> <img src="https://avatars0.githubusercontent.com/u/52209941?s=460&u=10cdd32a6dffc5d10e4dfd6d46821e59fbff5ca6&v=4" width="50"> [Saurabh Nikam](https://github.com/saurabh-nikam/)
 
+> <img src="https://avatars1.githubusercontent.com/u/53162729?s=400&u=16783675e602b7de353919c32357c7e12bc69ee3&v=4" width="50"> [Sahil Agarwal](https://github.com/agarwalsahil0210)

c_plus_plus/Raman/Graph/.cph/.Building_Roads.cpp_7e433b79cd927b9dba1a6a4298f53e3d.prob

@@ -0,0 +1 @@
+{"name":"Building Roads","group":"CSES - CSES Problem Set","url":"https://cses.fi/problemset/task/1666","interactive":false,"memoryLimit":512,"timeLimit":1000,"tests":[{"id":1601085870725,"input":"4 2\n1 2\n3 4\n","output":"1\n2 3\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BuildingRoads"}},"srcPath":"/media/zcruz/Data/Study/CPLibrary/Problems/CSES/Graph/Building_Roads.cpp"}

c_plus_plus/Raman/Graph/.cph/.Building_Teams.cpp_92e4fa58d42efc981141d3cb07c9a894.prob

@@ -0,0 +1 @@
+{"name":"Building Teams","group":"CSES - CSES Problem Set","url":"https://cses.fi/problemset/task/1668","interactive":false,"memoryLimit":512,"timeLimit":1000,"tests":[{"id":1601357601408,"input":"5 3\n1 2\n1 3\n4 5\n","output":"1 2 2 1 2\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BuildingTeams"}},"srcPath":"/media/zcruz/Data/Study/CPLibrary/Problems/CSES/Graph/Building_Teams.cpp"}

c_plus_plus/Raman/Graph/.cph/.Counting_Rooms.cpp_ae7f61321e7c7e80dfedd5c2b3aa88a2.prob

@@ -0,0 +1 @@
+{"name":"Counting Rooms","group":"CSES - CSES Problem Set","url":"https://cses.fi/problemset/task/1192","interactive":false,"memoryLimit":512,"timeLimit":1000,"tests":[{"id":1601085822567,"input":"5 8\n########\n#..#...#\n####.#.#\n#..#...#\n########\n","output":"3\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CountingRooms"}},"srcPath":"/media/zcruz/Data/Study/CPLibrary/Problems/CSES/Graph/Counting_Rooms.cpp"}

c_plus_plus/Raman/Graph/.cph/.Labyrinth.cpp_f8635e9a69fb9d7315154109f3317af4.prob

@@ -0,0 +1 @@
+{"name":"Labyrinth","group":"CSES - CSES Problem Set","url":"https://cses.fi/problemset/task/1193","interactive":false,"memoryLimit":512,"timeLimit":1000,"tests":[{"id":1601085858617,"input":"5 8\n########\n#.A#...#\n#.##.#B#\n#......#\n########\n","output":"YES\n9\nLDDRRRRRU\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Labyrinth"}},"srcPath":"/media/zcruz/Data/Study/CPLibrary/Problems/CSES/Graph/Labyrinth.cpp"}

c_plus_plus/Raman/Graph/.cph/.Message_Route.cpp_71d5c75dbdb56d6c744588c775d202f5.prob

@@ -0,0 +1 @@
+{"name":"Message Route","group":"CSES - CSES Problem Set","url":"https://cses.fi/problemset/task/1667","interactive":false,"memoryLimit":512,"timeLimit":1000,"tests":[{"id":1601106441000,"input":"5 5\n1 2\n1 3\n1 4\n2 3\n5 4\n","output":"3\n1 4 5\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MessageRoute"}},"srcPath":"/media/zcruz/Data/Study/CPLibrary/Problems/CSES/Graph/Message_Route.cpp"}

c_plus_plus/Raman/Graph/.vscode/settings.json

@@ -0,0 +1,5 @@
+{
+    "files.associations": {
+        "iostream": "cpp"
+    }
+}

c_plus_plus/Raman/Graph/Raman_Building_Roads.cpp

@@ -0,0 +1,47 @@
+#include<bits/stdc++.h>
+using namespace std;
+void DFS_util(int node,vector<vector<int>>&mat,vector<bool>&visited)
+{
+   visited[node]=true;
+   for(auto v:mat[node])
+   {
+       if(!visited[v])
+       DFS_util(v,mat,visited);
+   }
+}
+int main()
+{
+ios_base::sync_with_stdio(false);
+cin.tie(NULL);
+int n,m;
+cin>>n>>m;
+vector<vector<int>>g(n);
+for(int i=0;i<m;i++)
+{
+    int u,v;
+  cin>>u>>v;
+  g[u-1].push_back(v-1);
+  g[v-1].push_back(u-1);
+}
+vector<bool>visited(n,false);
+vector<int>cities;
+int comp=0;
+for(int i=0;i<n;i++)
+{
+    if(!visited[i])
+    {   
+        cities.push_back(i);
+        DFS_util(i,g,visited);
+        comp++;
+    }
+}
+int start=cities[0]+1;
+cout<<comp-1<<endl;
+for(int i=1;i<cities.size();i++)
+{
+  cout<<start<<" "<<cities[i]+1<<endl;
+}
+
+
+return 0;
+}

c_plus_plus/Raman/Graph/Raman_Building_Teams.cpp

@@ -0,0 +1,62 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+
+bool DFS_color(int node,int col, vector<int>&color,vector<vector<int>>&g)
+{
+    
+    color[node]=col;
+    bool res=true;
+    for(auto v:g[node])
+    {
+       
+        if(color[v]==0)
+        {
+         
+            res= res&DFS_color(v,(col^3),color,g);            
+        }
+        if(color[node]==color[v])
+        return false;
+
+    }
+    return res;
+}
+
+int main()
+{
+ios_base::sync_with_stdio(false);
+cin.tie(NULL);
+
+int n,m;
+cin>>n>>m;
+vector<vector<int>> g(n);
+vector<int>color(n,0);
+
+for(int i=0;i<m;i++)
+{
+    int u,v;
+    cin>>u>>v;
+    g[u-1].push_back(v-1);
+    g[v-1].push_back(u-1);
+}
+bool res=true;
+for(int i=0;i<n;i++)
+{
+    if(color[i]==0)
+    {
+       res=res&DFS_color(i,1,color,g);
+    }
+}
+if(res)
+{
+for(int i=0;i<n;i++)
+cout<<color[i]<<" ";
+cout<<endl;
+}
+else
+{
+cout<<"IMPOSSIBLE\n";
+}
+
+return 0;
+}

c_plus_plus/Raman/Graph/Raman_Counting_Rooms.cpp

@@ -0,0 +1,65 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+vector<pair<int,int>> paths={{-1,0},{0,-1},{1,0},{0,1}};
+bool valid_node(pair<int,int>&cord,int r,int c)
+{
+    if(cord.first < r && cord.second < c && cord.first > -1 && cord.second >-1)
+    return true;
+    return false;
+}
+void DFS_util(pair<int,int>&node,vector<vector<char>>&mat,vector<vector<bool>>&visited)
+{
+    
+   
+    visited[node.first][node.second] =true;
+   
+    for(auto path:paths)
+    {   
+         pair<int,int>temp={node.first+path.first,node.second+path.second};
+      
+        if(valid_node(temp,mat.size(),mat[0].size()) && !visited[temp.first][temp.second])
+        {
+            DFS_util(temp,mat,visited);
+        }
+    }
+}
+int main()
+{
+ios_base::sync_with_stdio(false);
+cin.tie(NULL);
+int n,m;
+cin>>n>>m;
+vector<vector<char>>mat(n,vector<char>(m));
+vector<vector<bool>>visited(n,vector<bool>(m));
+for(int i=0;i<n;i++)
+{
+    for(int j=0;j<m;j++)
+    {
+        cin>>mat[i][j];
+        if(mat[i][j]=='#')
+        visited[i][j]=true;
+        else
+        visited[i][j]=false;
+        
+    }
+}
+int count=0;
+pair<int,int> start;
+
+for(int i=0;i<n;i++)
+{
+    for(int j=0;j<m;j++)
+    {
+        if(!visited[i][j])
+        {
+            start={i,j};
+            DFS_util(start,mat,visited);
+            count++;
+        }
+    }
+}
+cout<<count<<endl;
+
+return 0;
+}