**Critical Planets**

**Problem Description**

War between Republic and Separatist is escalating. The Separatist are on a new offensive. They have started blocking the path between the republic planets (represented by integers), so that these planets surrender due to the shortage of food and supplies. The Jedi council has taken a note of the situation and they have assigned Jedi Knight Skywalker and his Padawan Ahsoka to save the critical planets from blockade (Those planets or system of planets which can be accessed by only one path and may be lost if that path is blocked by separatist).

Skywalker is preparing with the clone army to defend the critical paths. He has assigned Ahsoka to find the critical planets. Help Ahsoka to find the critical planets(C) in ascending order. You only need to specify those planets which have only one path between them and they cannot be accessed by any other alternative path if the only path is compromised.

Constraints

M <= 10000

N <= 7000

**Input**

First line contains two space separated integers M and N, where M denotes the number of paths between planets and N denotes the number of planets.

Next M lines, each contains two space separated integers, representing the planet numbers that have a path between them.

Output

C lines containing one integer representing the critical planet that they need to save in ascending order of the planet number if no planet is critical then print -1

Time Limit

1

**Examples**

**Example 1**

**Input**

3 4

0 1

1 2

2 3

**Output**

0

1

2

3

**Explanation**

Since all the planets are connected with one path and cannot be accessed by any alternative paths hence all the planets are critical.

**Example 2**

**Input**

7 6

0 2

0 1

1 2

2 3

4 5

3 4

3 5

**Output**

2

3

**Explanation**

If the republic loose the path between 2 and 3 then the two system of planets will not be able to communicate with each other. Hence 2 and 3 are critical planets.

**Recommended: Please try your approach on your integrated development environment (IDE) first, before moving on to the solution.**

**Few words from CodingHumans : Don't Just copy paste the solution, try to analyze the problem and solve it without looking by taking the the solution as a hint or a reference . Your understanding of the solution matters.**

**HAPPY CODING**😁

**Solution**

**( C++ )**

#include <bits/stdc++.h> typedef long long int lli; #define pb push_back using namespace std; vector<int> adj[100001]; int visited[100001] , in[100001] ,low[100001]; int timer; set<int> s; void dfs(int node , int pre) { visited[node] = 1; in[node] = low[node] = timer; timer++; for(int i : adj[node]) { if(i == pre) continue; if(visited[i] == 1) { low[node] = min(low[node] , in[i]); } else { dfs(i , node); if(low[i] > in[node]) s.insert(node) , s.insert(i); low[node] = min(low[node] , low[i]); } } } int main() { int edge, vertex , a , b; cin >> edge >> vertex; for(int i = 0;i < edge;i++) { cin >> a >> b; adj[a].pb(b); adj[b].pb(a); } dfs(0 , -1); for(int i : s) cout << i << endl; return 0; }

**Output**

0

1

2

3

#### Recommended Codevita Problems

Count Pairs | TCS CodeVita 9 Solution ( Zone 1 ) 2020

Lift | TCS CodeVita 9 Solution ( Zone 1 ) 2020

Number Distancing | TCS CodeVita 9 Solution ( Zone 1 ) 2020

Critical Planets | TCS CodeVita 9 Solution ( Zone 1 ) 2020

Prime Time Again | TCS CodeVita 9 Solution ( Zone 1 ) 2020

Minimum Gifts | TCS CodeVita 9 Solution ( Zone 1 ) 2020

Minimize The Sum | TCS CodeVita 9 Solution ( Zone 1 ) 2020

Railway Station | TCS CodeVita 9 Solution ( Zone 1 ) 2020